Structural Theorem on Plane Graphs with Application to the Entire Coloring Number

Journal of Graph Theory

Volumn 23, Issue 3, 1996, Pages 233-239

  Borodin, Oleg V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1542580084     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199611)23:3<233::AID-JGT3>3.0.CO;2-T     Document Type: Article

References (12)

1. M. Behzad, G. Chartrand, and J. Cooper, The coloring numbers of complete graphs, J. London Math. Soc. 42 (1967), 226-229.
2. O. V. Borodin, Solution of Ringel's problems on vertex-face coloring of plane graphs and coloring of 1-planar graphs, Met. Diskret. Analyz., Novosibirsk 41 (1984), 12-26. [Russian]
3. O. V. Borodin, Consistent colorings of graphs on the plane. Met. Diskret. Analyz., Novosibirsk 45 (1987), 21-27. [Russian]
4. O. V. Borodin, Simultaneous coloring of vertices, edges and faces of plane graphs, Met. Diskret. Analyz., Novosibirsk (1988), 27-37. [Russian]
5. O. V. Borodin, A structural theorem on plane graphs and its application to coloring, Diskret. Matem. 4(1) (1992), 60-65. [Russian]
6. A. Kotzig, Contribution to the theory of eulerian polyhedra, Mat. Cas. 5 (1955), 101-103. [Russian],
7. H. Kronk and J. Mitchem, A seven-color theorem on the sphere, Discrete Math. 5 (1973), 255-260.
8. H. Lebesgue, Quelques consequences simple de la formule d'Euler, J. de Math. 9 (1940), 27-43.
9. O. Ore, The four color problem. Pure and Applied Math., Vol. 27. Academic Press, New York-London (1967).
10. G. Ringel, Ein Sechsfarbenproblem auf de Kugel, Abh. Math. Sem. Univ. Hamburg 29 (1965), 107-117.
11. B. Toft, Graph coloring problems. 1. Preprint, Odense Univ. 2 (1987).
12. V. G. Vizing, Some unsolved problems in graph theory, Uspehi Mat. Nauk 233 (1968), 117-134.