The Grötzsch Theorem for the hypergraph of maximal cliques

Electronic Journal of Combinatorics

Volumn 6, Issue 1, 1999, Pages

  Mohar, Bojan ^a   Škrekovski, Riste ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002231490     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1458     Document Type: Article

References (10)

1. K. Appel and W. Haken, Every planar map is four colorable, Contemporary Mathematics 98, AMS, 1989.
2. G. Bacsó, S. Gravier, A. Gyárfás, M. Preissmann, and A. Sebö, About coloring the hypergraph of maximal cliques of a graph, manuscript.
3. J. Gimbel and C. Thomassen, Coloring graphs with fixed genus and girth, Trans. Amer. Math. Soc. 349 (1997) 4555-4564.
4. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin Luther Univ. Halle-Wittenberg, Math. Naturwiss. Reihe 8 (1959) 109-120.
5. T. R. Jensen and B. Toft, Graph Coloring Problems. Wiley Interscience, New York, 1995.
6. J. Kratochvíl and Z. Tuza, Algorithmic complexity of list colorings, Discrete Appl. Math. 50 (1994) 297-302.
7. N. Robertson, D. Sanders, P. Seymour, and R. Thomas, The four-color theorem, J. Combin. Theory Ser. B 70 (1997) 2-44.
8. R. Steinberg, The state of the three color problem. In J. Gimbel, J. W. Kennedy, and L. V. Quintas (editors), in Quo Vadis, Graph Theory?, Annals of Discrete Mathematics 55 211-248.
9. R. Steinberg, An update on the state of the three color problem, Graph Theory Notes of NYAS XXV (J. W. Kennedy and L. V. Quintas, eds.) New York Academy of Sciences, 1993.
10. M. Voigt, A not 3-choosable planar graph without 3-cycles. Discrete Math. 146 (1995) 325-328.