Abstract
Graph colourings may be viewed as special constraint satisfaction problems. The class of k-colouring problems enjoys a well known dichotomy of complexity — these problems are polynomial time solvable when k ≤ 2, and NP-complete when k ≥ 3. For general constraint satisfaction problems such dichotomy was conjectured by Feder and Vardi, but has still not been proved in full generality. We discuss some results and techniques related to this Dichotomy Conjecture. We focus on the effects of a new concept of ‘fullness’, and how it affects the complexity of constraint satisfaction problems and their dichotomy. Full constraint satisfaction problems may then be specialized back to graph colourings, yielding an interesting novel class of problems in graph theory, related to the study of graph perfection.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Aspvall, F. Plass and R. E. Tarjan, A linear time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters, Vol. 8 (1979), 121–123.
H.-J. Bandelt, A. Dählmann, H. Schütte, Absolute retracts of bipartite graphs, Discrete Appl. Math. 16 (1987), 191–215.
H.-J. Bandelt, M. Farber, and P. Hell, Absolute reflexive retracts and absolute bipartite retracts, Discrete Applied Math. 44 (1993), 9–20.
H.-J. Bandelt, E. Pesch, Efficient characterizations of n-chromatic absolute retracts, J. Combinatorial Theory B 53 (1991), 5–31.
J. Bang-Jensen and P. Hell, The effect of two cyles on the complexity of colourings by directed graphs, Discrete Applied Math. 26 (1990), 1–23.
J. Bang-Jensen, P. Hell, and G. MacGillivray, The complexity of colouring by semicomplete digraphs, SIAM J. on Discrete Math. 1 (1988), 281–298.
J. Bang-Jensen, P. Hell, and G. MacGillivray, On the complexity of colouring by superdigraphs of bipartite graphs, Discrete Math. 109 (1992), 27–44.
J. Bang-Jensen, P. Hell, and G. MacGillivray, Hereditarily hard H-colouring problems, Discrete Math. 138 (1995), 75–92.
M. Birc, M. Hujter, and Zs. Tuza, Precoloring extension I; interval graphs, Discrete Math. 100 (1992), 267–279.
R. Brewster, T. Feder, P. Hell, J. Huang, and G. MacGillivray, Near unanimity functions and varieties of graphs, manuscript 2004.
K. Borsuk, Sur les rétractes, Fund. Math. 17 (1931), 152–170.
A. Branstädt, P. Hammer, V. Bang Le, and V. Lozin, Bisplit graphs, DIM ACS Technical Report 2002-44 (2002).
A. A. Bulatov, Tractable conservative constraint satisfaction problems, In Proceedings of the 18th IEEE Annual Symposium on Logic in Computer Science (LICS 2003), 321–330.
A. A. Bulatov, Maltsev constraints are tractable, Technical report PRG RR-02-05 Oxford University (2002).
A. A. Bulatov, A dichotomy constraint on a three-element set, In Proceedings of the 43rd IEEE Symposium on Theory of Computing (2002), 649–658.
A. A. Bulatov, H-colouring dichotomy revisited, Theoretical Computer Science, to appear.
A. A. Bulatov and P. Jeavons, Algebraic structures in combinatorial problems, Technical Report MATH-AL-4-2001m Technische univer-sität Dresden, Germany, 2001.
A. A. Bulatov, P. Jeavons, and A. A. Krokhin, Classifying complexity of constraints using finite algebras, SIAM J. on Computing 34 (2005), 720–742.
K. Cameron, E. E. Eschen, C. T. Hoang and R. Sritharan, The list partition problem for graphs, Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2004, 391–399.
E. Cheng, R. P. Kleinberg, S. G. Kruk, W. A. Lindsey, and D. E. Steffy, A strictly combinatorial approach to a university exam scheduling problem, Congr. Numer. 167 (2004) 121–132.
M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, to appear in the Annals of Math.
V. Chvátal, Star-cutsets and perfect graphs, J. Combinatorial Theory B 39 (1985), 189–199.
D. Cohen, M. Cooper, and P. Jeavons, Characterizing tractable constraints, Artificial Intelligence 65 (1994), 347–361.
N. Creignou, S. Khanna, and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monographs on Discrete Math. and Applications, vol. 7 (2001).
V. Dalmau, A new tractable class of constraint satisfaction problems, in Proceedings 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
V. Dalmau and D. Ford, 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 2747, Springer 2003, 358–367.
R. Dechter, Constraint networks, In Encyclopedia of Artificial Intelligence, 1992, 276–285.
W. F. Dowling and J. H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 1 (1984) 267–284.
T. Feder, Fanout limitations on constraint systems, Theoretical Computer Science 255 (2001), 281–293.
T. Feder, Homomorphisms to oriented cycles and k-partite satisfiability, SIAM J. Discrete Math. 14 (2001), 471–480.
T. Feder, Constraint satisfaction: a personal perspective, manuscript 2004.
T. Feder, A dichotomy theorem on fixed points of several nonexpansive mappings, to appear in SIAM J. Discrete Math.
T. Feder and D. Ford, Classification of bipartite Boolean constraint satisfaction through delta matroid intersection, manuscript.
T. Feder and P. Hell, List homomorphisms to reflexive graphs, J. Comb. Theory Series B 72 (1998), 236–250.
T. Feder and P. Hell, Full constraint satisfaction problems, to appear in SIAM J. on Computing.
T. Feder and P. Hell, Matrix partitions of perfect graphs, to appear in Berge Special Issue of Discrete Math.
T. Feder and P. Hell, On realizations of point determining graphs, and obstructions to full homomorphisms, manuscript 2004.
T. Feder and P. Hell, The complexity of retraction problems for reflexive digraphs, manuscript 2003.
T. Feder, P. Hell, and J. Huang, List homomorphisms and circular arc graphs, Combinatorica 19 (1999), 487–505.
T. Feder, P. Hell, and J. Huang, Bi-arc graphs and the complexity of list homomorphisms, J. Graph Theory 42 (1999), 61–80.
T. Feder, P. Hell, and J. Huang, List homomorphisms of graphs with bounded degrees, to appear in Discrete Math.
T. Feder, P. Hell, and J. Huang, List homomorphisms to reflexive digraphs, manuscript 2004.
T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of list partitions, SIAM J. Discrete Mathematics 16 (2003), 449–478.
T. Feder, P. Hell, S. Klein, L. Nogueira, and F. Protti, List matrix partitions of chordal graphs, Theoretical Computer Science 349 (2005), 52–66.
T. Feder, P. Hell, D. Král’, and J. Sgall, Two algorithms for list matrix partitions, Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2005, 870–876.
T. Feder, P. Hell, and B. Mohar, Acyclic homomorphisms and circular colorings of digraphs, SIAM J. Discrete Math. 17 (2003), 161–169.
T. Feder, P. Hell, and K. Tucker-Nally, Digraph matrix partitions and trigraph homomorphisms, manuscript 2004.
T. Feder, P. Hell, and W. Hochstättler, Generalized colourings (matrix partitions) of cographs, GT04 Special Berge Volume, to be published by Birkhauser.
T. Feder, F. Madelaine, and I. A. Stewart, Dichotomies for classes of homomorphism problems involving unary functions, Theoretical Computer Science 314 (2004), 1–43.
T. Feder and M. Y. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory, SI AM J. Gomput. 28 (1998), 236–250, (ALSO in STOC 25 (1993), 612–622).
C. M. H. de Figueiredo, S. Klein, Y. Kohayakawa and B. Reed, Finding skew partitions efficiently, J. Algorithms 37 (2000), 505–521.
A. Galluccio, P. Hell, J. Nešetřil, The complexity of H-colouring of bounded degree graphs, Discrete Math. 222 (2000), 101–109.
M. Garey and D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman and Company, 1979.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
W. Gutjahr, E. Welzl and G. Woeginger, Polynomial graph-colorings, Discrete Applied Math 35 (1992), 29–45.
P. Hell, Rétractions des graphes, PhD thesis, Université de Montreal, 1972.
P. Hell, Absolute planar retracts and the four color conjecture, J. Combinatorial Theory B 17 (1974), 5–10.
P. Hell, Absolute retracts in graphs, in Graphs and Combinatorics (R. A. Bari, F. Harary, eds.), Springer-Verlag Lecture Notes in Mathematics 406 (1974), 291–301.
P. Hell, S. Klein, L. Tito Nogueira, and F. Protti, Partitioning chordal graphs into independent sets and cliques, Discrete Applied Math. 141 (2004), 185–194.
P. Hell, S. Klein, L. Tito Nogueira, and F. Protti, Packing r-cliques in chordal graphs, Annals of O.R. 138 (2005), 179–187.
P. Hell, J. Nešetřil, The core of a graph, Discrete Math. 109 (1992), 117–126.
P. Hell and J. Nešetřil, On the complexity of H-coloring, J. Comb. Theory, Series B 48 (1990), 92–110.
P. Hell and J. Nešetřil, Counting list homomorphisms and graphs with bounded degrees, in Graphs, Morphisms and Statistical Physics (J. Nešetřil and P. Winkler, eds.) DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 63 (2004), 105–112.
P. Hell and J. Nešetřil, Graphs and Homomorphisms, Oxford University Press 2004.
P. Hell, J. Nešetřil, and X. Zhu, Complexity of tree homomorphisms, Discrete Applied Math. 70 (1996), 23–36.
P. Hell, I. Rival, Absolute retracts and varieties of reflexive graphs, Canad. J. Math. 39 (1987), 544–567.
A. Horn, On sentences which are true of direct unions of algebras, J. Symbolic Logic 16 (1951), 14–21.
M. Hujter and Zs. Tuza, Precoloring extension II; graph classes related to bipartite graphs, Acta Math. Universitatis Comenianae 62 (1993), 1–11.
M. Hujter and Zs. Tuza, Precoloring extension III; classes of perfect graphs, Combin. Probab. Comput. 5 (1996), 35–56.
E. M. Jawhari, D. Misane, M. Pouzet, Retracts: graphs and ordered sets from the metric point of view, Contemp. Math. (Amer. Math. Soc.) 57 (1986), 175–226.
P. Jeavons, On the algebraic structure of combinatorial problems, Theoretical Computer Science 200 (1998), 185–204.
P. Jeavons, D. Cohen, and M. Gyssens, Closure properties of constraints, J. of the ACM 44 (1997), 527–548.
P. Jeavons, D. Cohen, and M. Gyssens, A unifying framework for tractable constraints, Proc. 1st International Conference on Constraint Programming, CP′95, Cassis 1995.
D. S. Johnson, The NP-completeness columns: an ongoing guide, J. Algorithms 3 (1982), 89–99.
V. Kumar, Algorithms for constraint-satisfaction problems, AI Magazine 13 (1992), 32–44.
R. E. Ladner, On the structure of polynomial time reducibility, J. Assoc. Comput. Mach. 22 (1975), 155–171.
B. Larose, Taylor operations on finite reflexive structures, manuscript 2005.
B. Larose and C. Tardif, Projectivity and independent sets in powers of graphs, J. Graph Theory 40 (2002), 162–171.
B. Larose and L. Zádori, Finite posets and topological spaces in locally finite varieties, Algebra Universalis 52 (2004), 119–136.
B. Larose and L. Zádori, The complexity of the extendibility problem for finite posets, SIAM J. on Discrete Math. 17 (2003), 114–121.
P. Lincoln and J. C. Mitchell, Algorithmic aspects of type inference with subtypes, in Conf. Rec. 19th ACM Symp. on Principles of Programming Languages (1992), 293–304.
V. Lotfi and S. Sarin, A graph coloring algorithm for large scale scheduling problems, Comput. Oper. Res. 13 (1986), 27–32.
T. Łuczak, J, Nešetřil, A note on projective graphs, ITI series 2003, No. 130.
T. Łuczak, J. Nešetřil, Towards probabilistic analysis of the dichotomy problem, KAM-DIMATIA Series 2003–640, Charles Univ. Prague.
D. Marx, Precoloring extension on chordal graphs, manuscript 2003.
P. Meseguer, Constraint satisfaction problem: an overview, AICOM 2 (1989), 3–16.
J. C. Mitchell, Coercion and type inference (summary), in Conf. Rec. 11th ACM Symp. on Principles of Programming Languages (1984), 175–185.
U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences 7 (1974), 95–132.
E. Pesch, Retracts of Graphs, Athenaeum Verlag, Frankfurt 1988.
V. Pratt and J. Tiuryn, Satisfiability of inequalities in a poset, Fundamenta Informaticae 28 (1996), 165–182.
A. Pultr, V. Trnková, Combinatorial, Algebraic and Topological Representations of Groups, Semigroups and Categories, North-Holland, Amsterdam, 1980.
A. Quilliot, A retraction problem in graph theory, Discrete Math. 54 (1985), 61–71.
A. Salazar and R. V. Oakford, A graph formulation of a school scheduling algorithm, Comm. ACM 17 (1974), 696–698.
T. J. Schaefer, The complexity of satisfiability problems, Proc. 10th ACM Symp. on Theory of Computing (1978), 216–226.
R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics 55 (1985), 221–232.
E. P. K. Tsang, Foundations of Constraint Satisfaction, Academic Press, London and San Diego (1993).
M. Y. Vardi, Constraint satisfaction and database theory: a tutorial, Proceedings of the 19th Symposium on Principles of Database Systems (PODS 2000), 76–85.
N. Vikas, Computational complexity of compaction to reflexive cycles SIAM J. on Computing 32 (2003), 253–280.
M. Wand and P. M. O’Keefe, On the complexity of type inference with coercion, in Conf. on Functional Programming Languages and Computer Architecture (1989), 293–298.
W. Xie, Forbidden subgraph characterizations of matrix partitions, M.Sc. thesis, Simon Eraser University 2006.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hell, P. (2006). From Graph Colouring to Constraint Satisfaction: There and Back Again. In: Klazar, M., Kratochvíl, J., Loebl, M., Matoušek, J., Valtr, P., Thomas, R. (eds) Topics in Discrete Mathematics. Algorithms and Combinatorics, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33700-8_20
Download citation
DOI: https://doi.org/10.1007/3-540-33700-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33698-3
Online ISBN: 978-3-540-33700-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)