On the d-distance face chromatic number of plane graphs

Discrete Mathematics

Volumn 164, Issue 1-3, 1997, Pages 171-174

  Horňák, Mirko ^a   Jendrol', Stanislav ^a  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009763579     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00049-0     Document Type: Article

References (12)

1. O.V. Borodin, Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs, Metody Diskret. Analiz. 41 (1984) 12-26 (Russian).
2. O.V. Borodin, Diagonal 11-coloring of plane triangulations, J. Graph Theory 14 (1990) 701-704.
3. O.V. Borodin, Joint generalization of theorems by Lebesgue and Kotzig, Diskret. Mat. 3 (1991) (Russian).
4. O.V. Borodin, Cyclic colouring of plane graphs, Discrete Math. 100 (1992) 281-289.
5. A. Bouchet, J.-L. Fouquet, J.-L. Jolivet and M. Rivière, On a special face colouring of cubic graphs, Ars Combin. 24 (1987) 67-76.
6. J.L. Gross and T.W. Tucker, Topological Graph Theory (Wiley, New York, 1987).
7. M. Horňák and S. Jendrol', On some properties of 4-regular plane graphs, J. Graph Theory 20 (1995) 163-175.
8. O. Ore and M.D. Plummer, Cyclic coloration of plane graphs, Recent Progress in Combinatorics, Proc. 3rd Waterloo Conf. on Combinatorics (Academic Press, New York, 1969) 287-293.
9. M.D. Plummer and B. Toft, Cyclic coloration of 3-polytopes, J. Graph Theory 11 (1987) 507-515.
10. B. Toft and T.R. Jensen, Graph Coloring Problems (Wiley, New York) in press.
11. D.P. Sanders and Yue Zhao, On diagonally 10-colouring plane triangulations, J. Graph Theory 20 (1995) 77-85.
12. G. Ringel, Ein Sechsfarbenproblem auf der Kugel, Abh. Math. Sem. Univ. Hamburg 29 (1965) 107-117.