Near-unanimity functions and varieties of reflexive graphs

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 3, 2008, Pages 938-960

  Brewster, Richard C ^a   Feder, Tomas ^b   Hell, Pavol ^c   Huang, Jing ^d   Macgillivray, Gary ^d  

^a THOMPSON RIVERS UNIVERSITY   (Canada)

^b Stanford University   (United States)

^c SIMON FRASER UNIVERSITY   (Canada)

^d UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Dichotomy; Graph homomorphism; Homomorphism extension; Near unanimity function; Retraction

Indexed keywords

DICHOTOMY; GRAPH HOMOMORPHISM; HOMOMORPHISM EXTENSION; NEAR UNANIMITY FUNCTION; RETRACTION;

POLYNOMIAL APPROXIMATION;

EID: 56049125090     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103436748     Document Type: Article

References (31)

1. K. A. Baker and A. F. Pixley, Polynomial interpolation and the Chinese remainder theorem for algebraic systems, Math. Z., 143 (1975), pp. 165-174.
2. H. BANDELT, Graphs with edge-preserving majority functions, Discrete Math., 103 (1992), pp. 1-5.
3. H. J. Bandelt, M. Farber, and P. Hell, Absolute reflexive retracts, Discrete Appl. Math., 44 (1993), pp. 9-20.
4. R. C. Brewster and G. MacGillivray, Building blocks for the variety of absolute retracts, Discrete Math., 306 (2006), pp. 1758-1764.
5. A. A. Bulatov, Tractable conservative constraint satisfaction problems, in Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (Ottawa, Canada, 2003), IEEE Computer Society, Silver Spring, MD, pp. 321-330.
6. V. Dalmau and A. Krokhin, Majority constraints have bounded pathwidth duality, European J. Combin., to appear.
7. P. Dukes, H. Emerson, and G. MacGillivray, Undecidable generalized colouring problems, J. Combin. Math. Combin. Comput., 26 (1998), pp. 97-112.
8. T. Feder, Classification of homomorphisms to oriented cycles and of k-partite satisfiability, SIAM J. Discrete Math., 14 (2001), pp. 471-480.
9. T. Feder and P. Hell, List homomorphisms to reflexive graphs, J. Combin. Theory Ser. B, 72 (1998), pp. 236-250.
10. T. Feder, P. Hell, and J. Huang, List homomorphisms and circular arc graphs, Combinatorica, 19 (1999), pp. 487-505.
11. T. Feder, P. Hell, and J. Huang, Bi-arc graphs and the complexity of list homomorphisms, J. Graph Theory, 42 (2003), pp. 61-80.
12. T. Feder, P. Hell, B. Larose, C. Loten, and C. Tardif, Near Unanimity Functions and Tree Duals, manuscript, 2008.
13. T. Feder and M. Y. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104.
14. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
15. P. Hell, Retractions de graphes, Ph. D. thesis, Université de Montreal, Montreal, Canada, 1972.
16. P. Hell and J. Nešetřil, On the complexity of H-colouring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
17. P. Hell and J. Nešetřil, Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications 28, Oxford University Press, Oxford, UK, 2004.
18. P. Hell, J. Nešetřil, and X. Zhu, Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc, 348 (1996), pp. 1281-1297. (Pubitemid 126748659)
19. P. Hell and I. Rival, Absolute retracts and varieties of reflexive graphs, Canad. J. Math., 39 (1987), pp. 544-567.
20. A. P. Huhn, Schwach distributive Verbande. I, Acta Sci. Math. (Szeged), 33 (1972), pp. 297-305.
21. E. M. Jawhari, D. Misane, and M. Pouzet, Retracts: Graphs and ordered sets from the metric point of view, in Combinatorics and Ordered Sets, Contemp. Math. 57, AMS, Providence, RI, 1986, pp. 175-226.
22. H. W. Kin and V. Dalmau, Generalized majority-minority operations are tractable, in Proceedings of the Twentieth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society, Washington, DC, 2005, pp. 438-447.
23. G. Kun, B. Larose, and A. Memartolui, Private communication, 2004.
24. B. Larose, C. Loten, and C. Tardif, A characterisation of first-order constraint satisfaction problems, in Proceedings of the 21st IEEE Symposium on Logic in Computer Science, IEEE Computer Society, Washington, DC, 2006, pp. 201-210.
25. B. Larose, C. Loten, and L. Zádori, A polynomial time algorithm for near-unanimity graphs, J. Algorithms, 55 (2005), pp. 177-191.
26. I. Lin, T. McKee, and D. West, The leafage of a chordal graph, Discuss. Math. Graph Theory, 18 (1998), pp. 23-48.
27. C. Loten, Retractions of Chordal and Related Graphs, Ph. D. thesis, Simon Fraser University, Burnaby, BC, Canada, 2003.
28. R. Nowakowski and I. Rival, The smallest graph variety containing all paths, Discrete Math., 43 (1983), pp. 223-234.
29. R. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Math., 43 (1983), pp. 235-239.
30. E. Pesch, Retracts of Graphs, Mathematical Systems in Economics 110, Athenäum, Frankfurt am Main, 1988.
31. R. W. Quackenbush, I. Rival, and I. Rosenberg, Clones, order varieties, near unanimity functions and holes, Order, 7 (1990), pp. 239-247.