Nordhaus-gaddum-type theorems for decompositions into many parts

Journal of Graph Theory

Volumn 50, Issue 4, 2005, Pages 273-292

  Füredi, Zoltan ^a,b   Kostochka, Alexandr V ^a,c   Škrekovski, Riste ^d,e   Stiebitz, Michael ^f   West, Douglas B ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^d CHARLES UNIVERSITY   (Czech Republic)

^e UNIVERSITY OF LJUBLJANA   (Slovenia)

^f ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Chromatic number; Coloring number; Graph decomposition; List chromatic number; Nordhaus Gaddum Theorem; Surface embedding

Indexed keywords

EMBEDDED SYSTEMS; NUMBER THEORY; PARAMETER ESTIMATION;

CHROMATIC NUMBER; COLORING NUMBER; GRAPH DECOMPOSITION; LIST CHROMATIC NUMBER; NORDHAUS-GADDUM THEOREM;

GRAPH THEORY;

EID: 30544438238     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20113     Document Type: Article

References (24)

1. M. O. Albertson and J. P. Hutchinson, The three excluded cases of Dirac's map-color theorem, Ann New York Acad Sci 319 (1979), 7-17.
2. N. Alon, Choice numbers of graphs: A probabilistic approach, Combin Prob Comput 1 (1992), 107-114.
3. J. Bosák, Decompositions of Graphs, Kluwer Academic Publishers (Mathematics and Its Application, Volume 47), Dordrecht, 1990.
4. G. A. Dirac, Map colour theorems related to the Heawood colour formula, J Lond Math Soc 31 (1956), 460-471.
5. G. A. Dirac, Short proof of a map-colour theorem, Canad J Math 9 (1957), 225-226.
6. R. Diestel, Graph Theory, Springer-Verlag, New York, 1997.
7. P. Erdös and A. Hajnal, On chromatic number of graphs and set-systems, Acta Math Acad Sci Hungar 17 (1966), 61-99.
8. P. Erdös, A. L. Rubin, and H. Taylor, Choosability in graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI (1979), 125-157.
9. H. J. Finck, Über die chromatische Zahl eines Graphen und seines Komplementes (I), Wiss. Z. der TU Ilmenau 12 (1966), 243-246.
10. P. Franklin, A six-color problem, J Math Phys 13 (1934), 363-369.
11. R. L. Graham, B. Rothschild, and J. Spencer, Ramsey Theory, J. Wiley & Sons, New York, 1980.
12. P. J. Heawood, Map colour theorem, Quart J Pure Appl Math 24 (1890), 332-338.
13. S. Janson, T. Łuczak, and A. Rucinski, Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, 2000.
14. T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, 1995.
15. B. Mohar and C. Thomassen, Graphs on Surfaces, Johns Hopkins University Press, Baltimore, 2001.
16. E. A. Nordhaus and J. W. Gaddum, On complementary graphs, Am Math Monthly 63 (1956), 175-177.
17. J. Plesník, Bounds on the chromatic numbers of multiple factors of a complete graph, J Graph Theory 2 (1978), 9-17.
18. G. Ringel and J. W. T. Youngs, Solution of the Heawood map-coloring problem, Proc Natl Acad Sci USA 60 (1968), 438-445.
19. G. Ringel, Map Color Theorem, Springer-Verlag, New York, 1974.
20. F. P. Ramsey, On a problem of formal logic, Proc London Math Soc 30 (1930), 264-286.
21. G. Szekeres and H. S. Wilf, An inequality for the chromatic number of a graph, J Combin Theory Ser B 4 (1968), 1-3.
22. C. Thomassen, Every planar graph is 5-choosable, J Combin Theory Ser B 62 (1994), 180-181.
23. M. Voigt, List colorings of planar graphs, Discrete Math 120 (1993), 215-219.
24. T. Watkinson, A theorem of the Nordhaus-Gaddum class, Ars Combin 20-B (1985), 35-42.