Colorings and homomorphisms of degenerate and bounded degree graphs

Discrete Mathematics

Volumn 233, Issue 1-3, 2001, Pages 257-276

  Kostochka, A ^a   Nesetril J ^b   Smolikova P ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035962196     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00245-4     Document Type: Article

References (13)

1. M.O. Albertson, K.L. Collins, Homomorphisms of 3-chromatic graphs, Discrete Math. 54 (1985) 127-132.
2. B. Bollobás, A Probabilistic proof of an asymptotic formula for the number of labeled regular graphs, European J. Combin. 1 (1980) 311-316.
3. B. Bollobás, Random Graphs, Academic Press, London, 1985.
4. B. Courcelle, An algebraic and logic approach, in: J. van Leeuwen (Ed.), Handbook of TCS, Vol. B, Elsevier, Amsterdam, 1990, pp. 193-242.
5. B. Courcelle, Monadic second order logic, in: G. Rosenberg (Ed.), Handbook of graph grammars and computing by graph transformations, World Scientific, London, 1997, pp. 313-400.
6. A. Galluccio, P. Hell, J. Nešetřil, The complexity of H-colouring of bounded degree graphs, Discrete Math. 222 (2000) 101-109.
7. W. Gutjahr, E. Welzl, G. Woeginger, Polynomial graph colorings, Discrete Appl. Math. 35 (1992) 29-46.
8. P. Hell, J. Nešetřil, On the complexity of H-coloring, J. Combin. Theory B 48 (1990) 92-110.
9. B.D. McKay, Independent sets in regular graphs of high girth, Proceedings of Australia-Singapore Joint Conference on Information Processing and Combinatorial Mathematics, Singapore, 1986, Ars Combin. 23A (1987) 179-185.
10. J. Nešetřil, V. Rödl, Chromatically optimal rigid graphs, J. Combin. Theory B 46 (1989) 133-141.
11. J. Nešetřil, X. Zhu, On bounded treewidth duality of graphs, J. Graph Theory 23 (2) (1996) 151-162.
12. X. Zhu, Uniquely H-colorable graphs with large girth, J. Graph Theory 23 (1) (1996) 33-42.
13. X. Zhu, Circular chromatic number: a survey, Discrete Math. 229 (2001) 371-410.