CSP dichotomy for special triads

Proceedings of the American Mathematical Society

Volumn 137, Issue 9, 2009, Pages 2921-2934

  Barto, Libor ^a   Kozik, Marcin ^b,c   Maróti, Miklós ^d   Niven, Todd ^c  

^a CHARLES UNIVERSITY   (Czech Republic)

^b JAGIELLONIAN UNIVERSITY   (Poland)

^c Eduard ech Center   (Czech Republic)

^d UNIVERSITY OF SZEGED   (Hungary)

Author keywords

Constraint satisfaction problem; Graph coloring; Triad

Indexed keywords

EID: 70350379298     PISSN: 00029939     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0002-9939-09-09883-9     Document Type: Article

References (19)

1. Jørgen Bang-Jensen and Pavol Hell, The effect of two cycles on the complexity of colourings by directed graphs, Discrete Appl. Math. 26 (1990), no.1, 1-23. MR1028872 (91c:05072)
2. Andrei Bulatov, Peter Jeavons, and Andrei Krokhin, Classifying the complexity of constraints using finite algebras, SIAM J. Comput. 34 (2005), no.3, 720-742 (electronic). MR2137072 (2005k:68181)
3. Andrei A. Bulatov, Andrei A. Krokhin, and Peter Jeavons, Constraint satisfaction problems and finite algebras, Automata, languages and programming (Geneva, 2000), Lecture Notes in Comput. Sci., vol.1853, Springer, Berlin, 2000, pp. 272-282. MR1795899 (2001h:68137)
4. Libor Barto, Marcin Kozik, and Todd Niven, The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell), SIAM Journal on Computing 38 (2009), no.5, 1782-1802
5. Polymorphisms and the complexity of homomorphism problems, Proceedings of the 40th ACM Symposium on Theory of Computing, STOC'08, 2008.
6. Victor Dalmau and Justin Pearson, Closure functions and width 1 problems, Fifth International Conference on Principles and Practice of Constraint Programming (CP'99), 1999, Lecture Notes in Computer Science, vol.1713, Springer-Verlag, 2004, pp. 159-173.
7. Tomas Feder, Classification of homomorphisms to oriented cycles and of k-partite satisfiability, SIAM J. Discrete Math. 14 (2001), no.4, 471-480 (electronic). MR1861785 (2002j:05063)
8. Tomas Feder and Moshe Y. Vardi, The computational structure of monotonemonadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM J. Comput. 28 (1999), no.1, 57-104 (electronic). MR1630445 (2000e:68063)
9. W. Gutjahr, Graph colourings, Ph.D. Thesis, Free University Berlin, 1991.
10. Wolfgang Gutjahr, Emo Welzl, and Gerhard Woeginger, Polynomial graph-colorings, Discrete Appl. Math. 35 (1992), no.1, 29-45. MR1138082 (92m:05081)
11. R. Haggkvist, P. Hell, D. J. Miller, and V. Neumann Lara, On multiplicative graphs and the product conjecture, Combinatorica 8 (1988), no.1, 63-74. MR951994 (90e:05037)
12. Pavol Hell and Jaroslav Nesetril, On the complexity of H-coloring, J. Combin. Theory Ser. B 48 (1990), no.1, 92-110. MR1047555 (91m:68082)
13. Graphs and homomorphisms, Oxford Lecture Series in Mathematics and its Applications, vol.28, Oxford University Press, Oxford, 2004. MR2089014 (2005k:05002)
14. P. Hell, J. Nesetril, and X. Zhu, Complexity of tree homomorphisms, Discrete Appl. Math. 70 (1996), no.1, 23-36. MR1402736 (97e:68049)
15. Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc. 348 (1996), no.4, 1281-1297. MR1333391 (96h:05072)
16. Peter Jeavons, David Cohen, and Marc Gyssens, Closure properties of constraints, J. ACM 44 (1997), no.4, 527-548. MR1481313 (99a:68089)
17. Andrei Krokhin, Andrei Bulatov, and Peter Jeavons, The complexity of constraint satisfaction: An algebraic approach, Structural theory of automata, semigroups, and universal algebra, NATO Sci. Ser. II Math. Phys. Chem., vol.207, Springer, Dordrecht, 2005; notes taken by Alexander Semigrodskikh, pp. 181-213. MR2210131 (2006m:68053)
18. Benoit Larose and Pascal Tesson, Universal algebra and hardness results for constraint satisfaction problems, ICALP (2007), Lecture Notes in Comput. Sci., 4596, Springer, Berlin, 2007. MR2424689
19. Miklos Maroti and Ralph McKenzie, Existence theorems for weakly symmetric operations, Algebra Universalis 59 (2008), no.3-4, 463-489.