Colouring, constraint satisfaction, and complexity

Computer Science Review

Volumn 2, Issue 3, 2008, Pages 143-163

  Hell, Pavol ^a   Nešetřil, Jaroslav ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL ASPECTS; CONSTRAINT SATISFACTION; FOCUS OF ATTENTION; GENERAL CONSTRAINTS; GRAPH COLOURING; GRAPH HOMOMORPHISMS; THEORETICAL RESEARCH; UNIVERSAL ALGEBRA;

SURVEYS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 56049092969     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2008.10.003     Document Type: Article

References (186)

1. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming (2006), Elsevier xix+995p
2. Alon N., and Shapira A. Homomorphisms in graph property testing. In: Klazar M., Kratochvíl J., Matoušek J., Thomas R., and Valtr P. (Eds). Topics in Discrete Mathematics (2006), Springer 281-314
3. Alon N., Dinur I., Friedgut E., and Sudakov B. Graph products, Fourier analysis and spectral techniques. Geom. Funct. Anal. 14 (2004) 913-940
4. Arora S., Lund C., Motwani R., Sudan M., and Szegedy M. Proof verification and the hardness of approximation problems. J. ACM 45 (1998) 501-555
5. Atserias A. On digraph coloring problems and treewidth duality. European J. Combin. 29 (2008) 796-820 Also in: 20th IEEE Symposium on Logic in Computer Science (LICS), 2005, pp. 106-115
6. Aspvall B., Plass F., and Tarjan R.E. A linear time algorithm for testing the truth of certain quantified Boolean formulas. Inform. Process. Lett. 8 (1979) 121-123
7. R.N. Ball, J. Nešetřil, A. Pultr, Dualities in full homomorphisms, in: Semigroups, Acts, and Categories, with Applications to Graphs, Estonian Math. Society, Tartu, 2008, pp. 14-27
8. Bandelt H.-J., Dählmann A., and Schütte H. Absolute retracts of bipartite graphs. Discrete Appl. Math. 16 (1987) 191-215
9. Bandelt H.-J., Farber M., and Hell P. Absolute reflexive retracts and absolute bipartite retracts. Discrete Appl. Math. 44 (1993) 9-20
10. Bandelt H.-J., and Pesch E. Efficient characterizations of n-chromatic absolute retracts. J. Combin. Theory B 53 (1991) 5-31
11. Bang-Jensen J., and Hell P. The effect of two cyles on the complexity of colourings by directed graphs. Discrete Appl. Math. 26 (1990) 1-23
12. Bang-Jensen J., Hell P., and MacGillivray G. The complexity of colouring by semicomplete digraphs. SIAM J. Discrete Math. 1 (1988) 281-298
13. Bang-Jensen J., Hell P., and MacGillivray G. On the complexity of colouring by superdigraphs of bipartite graphs. Discrete Math. 109 (1992) 27-44
14. Bang-Jensen J., Hell P., and MacGillivray G. Hereditarily hard H-colouring problems. Discrete Math. 138 (1995) 75-92
15. L. Barto, M. Kozik, T. Niven, The CSP dichotomy holds for digraphs with no sources and sinks (a positive answer to a conjecture of Bang-Jensen and Hell), SIAM J. Computing. Also, Proc. of the 40th ACM Symposium on Theory of Computing, STOC'08, 2008 pp. 789-796 (in press)
16. Birc M., Hujter M., and Tuza Zs. Precoloring extension I; interval graphs. Discrete Math. 100 (1992) 267-279
17. J. Berman, P. Idziak, P. Markovic, R. McKenzie, M. Valeriote, R. Willard, Varieties with few subalgebras of powers, Trans. Amer. Math. Soc. (2008) (in press)
18. Bodnarčuk V.G., Kaluzhnin L.A., Kotov V.N., and Romov B.A. Galois theory for Post algebras I-II. Kibernetika 3 (1969) 1-10 (in Russian) and 5 (1969), 1-9; english version Cybernetics (1969) 243-252 and 531-539
19. Borgs C., Chayes J., Lovász L., Sós V.T., and Vesztergombi K. Counting graph homomorphisms. In: Klazar M., Kratochvíl J., Matoušek J., Thomas R., and Valtr P. (Eds). Topics in Discrete Mathematics (2006), Springer 315-372
20. Borsuk K. Sur les rétractes. Fund. Math. 17 (1931) 152-170
21. Brewster R., Feder T., Hell P., Huang J., and MacGillivray G. Near-unanimity functions and varieties of graphs. SIAM J. Discrete Math. 22 (2008) 938-960
22. A.A. Bulatov, Tractable conservative constraint satisfaction problems, in: Proceedings of the 18th IEEE Annual Symposium on Logic in Computer Science, LICS 2003, pp. 321-330
23. A.A. Bulatov, Maltsev constraints are tractable, Technical Report PRG-RR-02-05 Oxford University, 2002
24. A.A. Bulatov, A dichotomy constraint on a three-element set, in: Proceedings of the 43rd IEEE Symposium on Theory of Computing, 2002, pp. 649-658
25. Bulatov A.A. H-colouring dichotomy revisited. Theoret. Comput. Sci. 349 (2005) 31-39
26. Bulatov A.A., and Dalmau V. Maltsev constraints are tractable. SIAM J. Comput. 36 (2006) 16-27
27. A.A. Bulatov, P. Jeavons, Algebraic structures in combinatorial problems, Technical Report MATH-AL-4-2001m Technische universität Dresden, Germany, 2001
28. Bulatov A.A., Jeavons P., and Krokhin A.A. Classifying complexity of constraints using finite algebras. SIAM J. Comput. 34 (2005) 720-742
29. A. Bulatov, A. Krokhin, B. Larose, Dualities for constraint satisfaction problems, in: Proceedings of the Dagstuhl Seminar on the Complexity of Constraints, Springer Lecture Notes in Computer Science, 2008 (in press)
30. K. Cameron, E.E. Eschen, C.T. Hoang, R. Sritharan, The list partition problem for graphs, in: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 391-399. Also, SIAM J. Discrete Math. 21 (2007) 900-929
31. Cheng E., Kleinberg R.P., Kruk S.G., Lindsey W.A., and Steffy D.E. A strictly combinatorial approach to a university exam scheduling problem. Congr. Numer. 167 (2004) 121-132
32. Chudnovsky M., Robertson N., Seymour P., and Thomas R. The strong perfect graph theorem. Ann. Math. 164 (2006) 51-229
33. Chvátal V. Star-cutsets and perfect graphs. J. Combin. Theory B 39 (1985) 189-199
34. Cohen D., Cooper M., and Jeavons P. Characterizing tractable constraints. Artificial Intelligence 65 (1994) 347-361
35. Cohen D., Cooper M., Jeavons P., and Krokhin A. A maximal tractable class of soft constraints. J. Artificial Intelligence Res. 22 (2004) 1-22
36. Creignou N., Khanna S., and Sudan M. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Math. and Applications vol. 7 (2001)
37. V. Dalmau, A new tractable class of constraint satisfaction problems, in: Proceedings 6th International Symposium on Artificial Intelligence and Mathematics, 2000
38. V. Dalmau, Generalized majority-minority operations are tractable, in: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science, LICS 05, pp. 438-447
39. Dalmau V., and Ford D. Generalized satisfiability with k occurrences per variable: A study through delta-matroid parity. Mathematical Foundations of Computer Science (MFCS 2003). Lecture Notes in Computer Science vol. 2747 (2003), Springer 358-367
40. Dalmau V., Krokhin A., and Larose B. First-order definable retraction problems for posets and reflexive graphs. J. Logic Comput. 17 (2007) 31-51 also in LICS 2004, pp. 232-241
41. Dalmau V., Krokhin A., and Larose B. Retractions onto series-parallel posets. Discrete Math. 308 (2008) 2104-2114
42. Datar M., Feder T., Gionis A., Motwani R., and Panigrahy R. A combinatorial algorithm for MAX CSP. Inform. Process. Lett. 85 (2003) 307-315
43. Dechter R. Constraint networks. Encyclopedia of Artificial Intelligence (1992) 276-285
44. Dinur I. The PCP theorem by gap amplification. J. ACM 54 (2007) 12
45. I. Dinur, E. Friedgut, O. Regev, Independent sets in graph powers are almost contained in juntas, GAFA (in press)
46. Dowling W.F., and Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Program. 1 (1984) 267-284
47. L. Egri, B. Larose, P. Tesson, The complexity of list homomorphism problems for graphs (in preparation)
48. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R. Karp (Ed.), Complexity of Computation, SIAM-AMS Proceedings 7, 1974, pp. 43-73
49. Feder T. Homomorphisms to oriented cycles and k-partite satisfiability. SIAM J. Discrete Math. 14 (2001) 471-480
50. T. Feder, Constraint satisfaction: A personal perspective, manuscript 2004
51. Feder T. A dichotomy theorem on fixed points of several nonexpansive mappings. SIAM J. Discrete Math. 20 (2006) 291-301
52. T. Feder, D. Ford, Classification of bipartite Boolean constraint satisfaction through delta-matroid intersection, manuscript
53. Feder T., and Hell P. List homomorphisms to reflexive graphs. J. Comb. Theory Ser. B 72 (1998) 236-250
54. Feder T., and Hell P. Full constraint satisfaction problems. SIAM J. Comput. 36 (2006) 230-246
55. Feder T., and Hell P. Matrix partitions of perfect graphs. Discrete Math. 306 (2006) 2450-2460
56. Feder T., and Hell P. On realizations of point determining graphs, and obstructions to full homomorphisms. Discrete Math. 308 (2008) 1639-1652
57. T. Feder, P. Hell, The complexity of retraction and subretraction problems for reflexive digraphs, manuscript 2007
58. Feder T., Hell P., and Huang J. List homomorphisms and circular arc graphs. Combinatorica 19 (1999) 487-505
59. Feder T., Hell P., and Huang J. Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42 (2003) 61-80
60. Feder T., Hell P., and Huang J. List homomorphisms of graphs with bounded degrees. Discrete Math. 307 (2007) 386-392
61. T. Feder, P. Hell, J. Huang, A. Rafiey, Adjusted interval digraphs, manuscript 2008
62. Feder T., Hell P., Klein S., and Motwani R. Complexity of list partitions. SIAM J. Discrete Mathematics 16 (2003) 449-478
63. Feder T., Hell P., Klein S., Nogueira L., and Protti F. List matrix partitions of chordal graphs. Theoret. Comput. Sci. 349 (2005) 52-66
64. Feder T., Hell P., Kral D., and Sgall J. Two algorithms for list matrix partitions. Symposium on Discrete Algorithms (2005) 870-876
65. Feder T., Hell P., and Mohar B. Acyclic homomorphisms and circular colorings of digraphs. SIAM J. Discrete Math. 17 (2003) 161-169
66. T. Feder, P. Hell, A. Rafiey, List homomorphisms to irreflexive digraphs, manuscript 2008
67. Feder T., Hell P., and Tucker-Nally K. Digraph matrix partitions and trigraph homomorphisms. Discrete Appl. Math. 154 (2006) 2458-2469
68. Feder T., Hell P., and Hochstättler W. Generalized colourings (matrix partitions) of cographs. Graph Theory in Paris, Trends in Mathematics (2006), Birkhauser Verlag 149-167
69. T. Feder, P. Hell, W. Xie, Obstructions to generalized colourings, ICDM 2006, Bangalore, India, Lecture Notes of the Ramanujan Math. Society 2007
70. Feder T., Madelaine F., and Stewart I.A. Dichotomies for classes of homomorphism problems involving unary functions. Theoret. Comput. Sci. 314 (2004) 1-43
71. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Comput. 28 (1998) 236-250 ALSO in STOC 25 (1993) 612-622
72. Fiala J., and Kratochvil J. Locally constrained graph homomorphisms. Comp. Sci. Rev. 2 (2008) 97-112
73. de Figueiredo C.M.H., Klein S., Kohayakawa Y., and Reed B. Finding skew partitions efficiently. J. Algorithms 37 (2000) 505-521
74. Foldes S., and Hammer P. Split graphs. Congr. Numer. 19 (1977) 311-315
75. Foniok J., Nešetřil J., and Tardif C. Generalized dualities and maximal finite antichains in the homomorphism order of relational structures. European J. Combin. 29 (2008) 881-899
76. Freedman M.H., Lovász L., and Schrijver A. Reflection positivity, rank connectivity and homomorphisms of graphs. J. Amer. Math. Soc. 20 (2007) 37-51
77. Gallai T. On directed paths and circuits. Theory of Graphs (Proc. Colloq., Tihany, 1966) (1968), Academic Press, New York 115-118
78. Galluccio A., Hell P., and Nešetřil J. The complexity of H-colouring of bounded degree graphs. Discrete Math. 222 (2000) 101-109
79. Garey M., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), Freeman and Company
80. Geiger D. Closed systems of functions and predicates. Pacific J. Math. 27 (1968) 95-100
81. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press, New York
82. Greenwell D., and Lovász L. Applications of product coloring. Acta Math. Acad. Sci. Hungar. 25 (1974) 335-340
83. Gupta A., Hell P., Karimi M., and Rafiey A. Minimum cost homomorphisms to reflexive digraphs. LATIN (2008)
84. A. Gupta, G. Gutin, M. Karimi, E.J. Kim, A. Rafiey, Minimum cost homomorphisms to locally semicomplete and quasi-transitive digraphs, manuscript 2008
85. A. Gupta, M. Karimi, E.J. Kim, A. Rafiey, Minimum cost homomorphism dichotomy for locally in-semicomplete digraphs, in: COCOA 2008
86. Gutin G., Hell P., Rafiey A., and Yeo A. Minimum cost homomorphisms to proper interval graphs and bigraphs. Europ. J. Combin. 29 (2008) 900-911
87. Gutin G., Rafiey A., and Yeo A. Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Appl. Math. 154 (2006) 890-897
88. Gutin G., Rafiey A., Yeo A., and Tso M. Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Appl. Math. (2007)
89. Gutin G., and Kim E.J. Introduction to the minimum cost homomorphism problem for directed and undirected graphs. Lecture Notes of the Ramanujan Math. Society (2007)
90. Gutjahr W., Welzl E., and Woeginger G. Polynomial graph-colorings. Discrete Appl. Math. 35 (1992) 29-45
91. Graham R.L., Rothschild B., and Spencer J. Ramsey Theory (1980), Wiley
92. Hasse M. Zur algebraischen Begründung der Graphentheorie I. Math Nachr. 28 (1964-1965) 275-290
93. P. Hell, Rétractions des graphes, Ph.D. Thesis, Université de Montréal, 1972
94. Hell P. Absolute planar retracts and the four color conjecture. J. Combin. Theory B 17 (1974) 5-10
95. Hell P. Absolute retracts in graphs. In: Bari R.A., and Harary F. (Eds). Graphs and Combinatorics. Springer-Verlag Lecture Notes in Mathematics vol. 406 (1974) 291-301
96. Hell P. From graph colouring to constraint satisfaction: There and back again. Topics in Discrete Mathematics. Springer Verlag Algorithms and Combinatorics Series vol. 26 (2006) 407-432
97. Hell P. Algorithmic aspects of graph homomorphisms. In: Wensley C.D. (Ed). Surveys in Combinatorics 2003. London Math. Society Lecture Note Series vol. 307 (2003), Cambridge University Press 239-276
98. Hell P., Klein S., Tito Nogueira L., and Protti F. Partitioning chordal graphs into independent sets and cliques. Discrete Appl. Math. 141 (2004) 185-194
99. Hell P., and Nešetřil J. The core of a graph. Discrete Math. 109 (1992) 117-126
100. Hell P., Nešetřil J., and Zhu X. Duality of graph homomorphisms. Combinatorics, Paul Erdos is Eighty. Bolyai Society Mathematical Studies vol. 2 (1996) 271-282
101. Hell P., and Nešetřil J. On the complexity of H-coloring. J. Comb. Theory, Ser. B 48 (1990) 92-110
102. Hell P., and Nešetřil J. Counting list homomorphisms and graphs with bounded degrees. In: Nešetřil J., and Winkler P. (Eds). Graphs, Morphisms and Statistical Physics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 63 (2004) 105-112
103. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford University Press
104. Hell P., Nešetřil J., and Zhu X. Complexity of tree homomorphisms. Discrete Appl. Math. 70 (1996) 23-36
105. Hell P., Nešetřil J., and Zhu X. Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc. 348 (1996) 1281-1297
106. Hell P., and Rival I. Absolute retracts and varieties of reflexive graphs. Canad. J. Math. 39 (1987) 544-567
107. Hoory S., Linial N., and Wigderson A. Expander graphs and their applications. Bull. Amer. Math. Soc. 43 (2006) 439-561
108. Horn A. On sentences which are true of direct unions of algebras. J. Symbolic Logic 16 (1951) 14-21
109. J. Hubička, J. Nešetřil, Universal structures as shadows of ultrahomogeneous structures (submitted for publication)
110. Hujter M., and Tuza Zs. Precoloring extension II; graph classes related to bipartite graphs. Acta Math. Universitatis Comenianae 62 (1993) 1-11
111. Hujter M., and Tuza Zs. Precoloring extension III; classes of perfect graphs. Combin. Probab. Comput. 5 (1996) 35-56
112. P. Idziak, P. Markovic, R. McKenzie, M. Valeriote, R. Willard, Tractability and learnability arising from algebras with few subpowers (extended abstract), in: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007, pp. 213-224
113. Jawhari E.M., Misane D., and Pouzet M. Retracts: Graphs and ordered sets from the metric point of view. Contemp. Math. (Amer. Math. Soc.) 57 (1986) 175-226
114. Jeavons P. On the algebraic structure of combinatorial problems. Theoret. Comput. Sci. 200 (1998) 185-204
115. Jeavons P., Cohen D., and Gyssens M. Closure properties of constraints. J. ACM 44 (1997) 527-548
116. P. Jeavons, D. Cohen, M. Gyssens, A unifying framework for tractable constraints, in: Proc. 1st International Conference on Constraint Programming, CP'95, Cassis 1995
117. Johnson D.S. The NP-completeness columns: An ongoing guide. J. Algorithms 3 (1982) 89-99
118. Kalai G. A Fourier-theoretic perspective for the Condorcet parados and Arrow's theorem. Adv. Appl. Math. 29 (2002) 412-426
119. 2 / log t. Random Struct. Algorithms 7 (1995) 173-207
120. P. Kolaitis, M. Vardi, Conjunctive-query containment and constraint satisfaction, in: Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems 1998, PODS'98, pp. 205-213
121. Kostochka A., Nešetřil J., and Smolíková P. Colorings and homomorphisms of degenerate and bounded degree graphs. Discrete Math. 233 (2001) 257-276
122. Krokhin A., and Larose B. Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction. SIAM J. Discrete Math. 22 (2008) 312-328
123. Kumar V. Algorithms for constraint-satisfaction problems. AI Mag. 13 (1992) 32-44
124. G. Kun, Constraints, MMSNP and expander structures, Combinatorica (submitted for publication)
125. G. Kun, M. Szegedy, A new line of attack on the dichotomy conjecture, manuscript 2008
126. Kun G., and Nešetřil J. Forbidden lifts (NP and CSP for combinatorists). European J. Combin. 29 (2008) 930-945
127. Ladner R.E. On the structure of polynomial time reducibility. J. Assoc. Comput. Mach. 22 (1975) 155-171
128. Larose B. Taylor operations on finite reflexive structures. Internat. J. Math. Comput. Sci. 1 (2006) 1-26
129. Larose B., and Tardif C. Projectivity and independent sets in powers of graphs. J. Graph Theory 40 (2002) 162-171
130. Larose B., Loten C., and Tardif C. A characterization of first-order constraint satisfaction problems. Logical Methods Comput. Sci. 3 4 (2007) 6, 22pp (electronic)
131. Larose B., Loten C., and Zádori L. A polynomial-time algorithm for near-unanimity graphs. J. Algorithms 55 (2005) 177-191
132. Larose B., and Zádori L. Finite posets and topological spaces in locally finite varieties. Algebra Universalis 52 (2004) 119-136
133. Larose B., and Zádori L. The complexity of the extendibility problem for finite posets. SIAM J. Discrete Math. 17 (2003) 114-121
134. P. Lincoln, J.C. Mitchell, Algorithmic aspects of type inference with subtypes, in: Conf. Rec. 19th ACM Symp. on Principles of Programming Languages, 1992, pp. 293-304
135. Lotfi V., and Sarin S. A graph coloring algorithm for large scale scheduling problems. Comput. Oper. Res. 13 (1986) 27-32
136. Łuczak T., and Nešetřil J. A note on projective graphs. J. Graph Theory 47 (2004) 81-86
137. T. Łuczak, J. Nešetřil, Towards probabilistic analysis of the dichotomy problem, KAM-DIMATIA Series 2003-640, Charles Univ. Prague
138. R. McKenzie, Personal communication, 2007
139. M. Maŕoti, R. McKenzie, Existence theorems for weakly symmetric operations, manuscript 2006, Algebra Universalis (in press)
140. Marx D. Precoloring extension on chordal graphs. Graph Theory in Paris, Trends in Mathematics (2007), Birkhäuser 255-270
141. J. Matoušek, J. Nešetřil, Constructions of sparse graphs with given homomorphisms, manuscript, 2004
142. Meseguer P. Constraint satisfaction problem: An overview. AICOM 2 (1989) 3-16
143. J.C. Mitchell, Coercion and type inference (summary), in: Conf. Rec. 11th ACM Symp. on Principles of Programming Languages, 1984, pp. 175-185
144. Müller V. On colorable critical and uniquely colorable critical graphs. In: Fiedler M. (Ed). Recent Advances in Graph Theory (1975), Academia, Prague
145. Müller V. On coloring of graphs without short cycles. Discrete Math. 26 (1979) 165-179
146. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci. 7 (1974) 95-132
147. Nešetřil J. Aspects of structural combinatorics. Taiwanese J. Math. 3, 4 (1999) 381-424
148. Nešetřil J. Ramsey Theory. In: Graham R.L., Grötschel M., and Lovász L. (Eds). Handbook of Combinatorics (1995), Elsevier 1331-1403
149. Nešetřil J. Many facets of dualities. In: Cook W., Lovász L., and Vygen J. (Eds). Research Trends in Combinatorial Optimization (2009), Springer, Berlin
150. Nešetřil J., and Ossona de Mendez P. Cuts and bounds. Discrete Math. 302 (2005) 211-224
151. Nešetřil J., and Ossona de Mendez P. Folding. J. Combin. Theory B 96 (2006) 730-739
152. Nešetřil J., and Ossona de Mendez P. Tree depth, subgraph coloring and homomorphism bounds. European J. Combin. 27 (2006) 1022-1041
153. Nešetřil J., and Ossona de Mendez P. Low tree-width decompositions and algorithmic consequences. Proceedings of the 38th Annual ACM Symposium on Theory of Computing. STOC'06 (2006), ACM Press 391-400
154. Nešetřil J., and Ossona de Mendez P. Structural properties of sparse graphs. In: Grötschel M., and Katona G.O.H. (Eds). Building Bridges - Between Mathematics and Computer Science (2008), Springer 369-426
155. Nešetřil J., and Ossona de Mendez P. Grad and classes with bounded expansion I. Decompositions. European J. Combin. 29 3 (2008) 760-776
156. Nešetřil J., and Ossona de Mendez P. Grad and classes with bounded expansion II. Algorithmic aspects. European J. Combin. 29 (2008) 777-791
157. Nešetřil J., and Ossona de Mendez P. Grad and classes with bounded expansion III. Restricted dualities. European J. Combin. 29 (2008) 1012-1024
158. J. Nešetřil, P. Ossona de Mendez, First order properties of nowhere dense structures, J. Symb. Logic (2008) (submitted for publication)
159. Nešetřil J., and Pultr A. On classes of relations and graphs determined by subobjects and factorobjects. Discrete Math. 22 (1978) 287-300
160. Nešetřil J., and Rödl V. Chromatically optimal rigid graphs. J. Combin. Th. B 46 (1989) 122-141
161. J. Nešetřil, M. Siggers, L. Zádori, A Combinatorial constraint satisfaction problem dichotomy classification conjecture, manuscript, 2007
162. Nešetřil J., and Siggers M. A combinatorial proof that subprojective constraint satisfaction problems are NP-complete. 32nd International Symposium MFCS 2007. Lecture Notes in Computer Science vol. 4708 (2007), Springer 159-170
163. Nešetřil J., and Tardif C. A dualistic approach to bounding the chromatic number of a graph. European J. Combin. 29 (2008) 254-260
164. Nešetřil J., and Tardif C. Homomorphism duality: On short answers to exponentially long questions. SIAM J. Discrete Math. 19 (2005) 914-920
165. Nešetřil J., and Tardif C. Duality theorems for finite structures (characterising gaps and good characterizations). J. Combin. Theory B 80 (2000) 80-97
166. Nešetřil J., and Zhu X. On sparse graphs with given colorings and homomorphisms. J. Combin. Th. B 90 (2004) 161-172
167. Pesch E. Retracts of Graphs (1988), Athenaeum Verlag, Frankfurt
168. Pratt V., and Tiuryn J. Satisfiability of inequalities in a poset. Fund. Inform. 28 (1996) 165-182
169. Pultr A., and Trnková V. Combinatorial, Algebraic and Topological Representations of Groups, Semigroups and Categories (1980), North-Holland, Amsterdam
170. Quilliot A. A retraction problem in graph theory. Discrete Math. 54 (1985) 61-71
171. Radhakrishnan J., and Sudan M. On Dinur's proof of the PCP theorem. Bull. Amer. Math. Soc. 44 (2007) 19-61
172. B. Rossman, Existential positive types and preservation under homomorphisms, in: 20th IEEE Symposium on Logic in Computer Science, LICS, 2005, pp. 467-476
173. Roy B. Nombre chromatique et plus longs chemins d'un graph. Rev. Francaise Informat. Recherche Opérationelle 1 (1967) 129-132
174. Vitaver L.M. Determination of minimal coloring of vertices of a graph by means of Boolean powers of the incidence matrix. Dokl. Akad. Nauk SSSR 147 (1962) 758-759 (in Russian)
175. Salazar A., and Oakford R.V. A graph formulation of a school scheduling algorithm. Comm. ACM 17 (1974) 696-698
176. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. 10th ACM Symp. on Theory of Computing, 1978, pp. 216-226
177. G. Schell, Tridiagonal matrix partitions, M.Sc. Thesis, SFU 2008
178. Tsang E.P.K. Foundations of Constraint Satisfaction (1993), Academic Press, London and San Diego
179. M.Y. Vardi, Constraint satisfaction and database theory: A tutorial, in: Proceedings of the 19th Symposium on Principles of Database Systems, PODS 2000, pp. 76-85
180. Vikas N. Computational complexity of compaction to reflexive cycles. SIAM J. Comput. 32 (2003) 253-280
181. M. Wand, P.M. O'Keefe, On the complexity of type inference with coercion, in: Conf. on Functional Programming Languages and Computer Architecture, 1989, pp. 293-298
182. Sen M., Das S., Roy A.B., and West D.B. Interval digraphs: An analogue of interval graphs. J. Graph Theory 13 (1989) 581-592
183. M.H. Siggers, H-colouring dichotomy re-revisited, manuscript, 2008
184. Tarjan R.E. Decomposition by clique separators. Discrete Math. 55 (1985) 221-232
185. Thomassen C. Grötzsch's 3-color theorem and its counterparts for torus and the projective plane. J. Combin. Th. B 62 (1994) 268-279
186. W. Xie, Forbidden subgraph characterizations of matrix partitions, M.Sc. Thesis, Simon Fraser University, 2006