Color-critical graphs on a fixed surface

Journal of Combinatorial Theory. Series B

Volumn 70, Issue 1, 1997, Pages 67-100

  Thomassen, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031139081     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.1722     Document Type: Article

References (22)

1. Albertson M. O., Stromquist W. R. Locally planar toroidal graphs are 5-colorable. Proc. Amer. Soc. 84:1982;449-456.
2. Barnette D. Coloring polyhedral manifolds. Discrete geometry and convexity. 1985;New York Acad. Sci.
3. M. Borowieck, E. Drgas-Burchardt, P. Mihók, 1995, Generalized list colorings of graphs.
4. Battle J., Harary F., Kodama Y., Youngs J. W. T. Additivity of the genus of a graph. Bull. Amer. Math. Soc. 68:1962;565-568.
5. Croft H. T., Falconer K. J., Guy R. K. Unsolved Problems in Geometry. 1991;Springer-Verlag.
6. Dirac G. A. The coloring of maps. J. London Math. Soc. 28:1953;476-480.
7. P. Erdös, A. L. Rubin, H. Taylor, Choosability in Graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California, 5-7.9.1979.
8. Fisk S. Geometric coloring theory. Advances Math. 24:1979;298-340.
9. Fisk S. The non-existence of colorings. J. Combin. Theory Ser. B. 24:1978;247-248.
10. Gallai T. Kritische Graphen I, II. Publ. Math. Inst. Hungar. Acad. Sci. 8:1963.
11. Garey M. R., Johnson D. S. Computers and Intractability. 1979;W. H. Freeman, San Francisco.
12. J. Gimbel, C. Thomassen, Coloring graphs with bounded genus and girth, Trans. Amer. Math. Soc.
13. S. Gutner, The complexity of planar graph choosability.
14. Jensen T., Toft B. Graph Coloring Problems. 1995;J. Wiley, New York.
15. Stahl S., Beineke L. Blocks and the nonorientable genus of a graph. J. Graph Theory. 1:1977;75-78.
16. Stromquist W. R. The four color problem for locally planar graphs. Bondy J. A., Murty U. S. R. Graph Theory and Related Topics. 1979;Academic, New York.
17. Thomassen C. Planarity and duality of finite and infinite graphs. J. Combin. Theory Ser. B. 29:1980;244-271.
18. Thomassen C. Embeddings of graphs with no short noncontractible cycles. J. Combin. Theory Ser. B. 48:1990;155-177.
19. Thomassen C. 5-coloring maps on surfaces. J. Combin. Theory Ser. B. 59:1993;89-105.
20. Thomassen C. Five-coloring graphs on the torus. J. Combin. Theory Ser. B. 62:1994;11-33.
21. Thomassen C. Every planar graph is 5-choosable. J. Combin. Theory Ser. B. 62:1994;180-181.
22. Voigt M. List colourings of planar graphs. Discrete Math. 120:1993;215-219.