论文信息 - Dirac's map-color theorem for choosability

Dirac's map-color theorem for choosability

It is proved that the choice number of every graph G embedded on a surface of Euler genus e ≥ 1 and e ≠ 3 is at most the Heawood number $H(\epsilon)= \lfloor(7+\sqrt{24\epsilon+1})/2\rfloor$ and that the equality holds if and only if G contains the complete graph KH(e) as a subgraph. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 327–339, 1999

Michael Stiebitz | Thomas Böhme | Bojan Mohar

[1] G. A. Dirac,et al. Short Proof of a Map-Colour Theorem , 1957, Canadian Journal of Mathematics.

[2] Carsten Thomassen,et al. Color-Critical Graphs on a Fixed Surface , 1997, J. Comb. Theory, Ser. B.

[3] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[4] P. Franklin. A Six Color Problem , 1934 .

[5] Michael O. Albertson,et al. THE THREE EXCLUDED CASES OF DIRAC'S MAP‐COLOR THEOREM 1 , 1979 .

[6] G. Ringel. Bestimmung der Maximalzahl der Nachbargebiete auf nichtorientierbaren Flächen , 1953 .

[7] Alexandr V. Kostochka,et al. The colour theorems of Brooks and Gallai extended , 1996, Discret. Math..

[8] G. A. Dirac,et al. Map Colour Theorems Related To the Heawood Colour Formula , 1956 .

[9] G. Ringel,et al. Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[10] G. A. Dirac,et al. A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger , 1957 .

[11] P. J. Heawood. Map-Colour Theorem , 1949 .