On vertex types and cyclic colourings of 3-connected plane graphs

Discrete Mathematics

Volumn 212, Issue 1-2, 2000, Pages 101-109

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

^a P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Cyclic chromatic number; Cyclic colouring; Plane graph; Vertex type

Indexed keywords

EID: 0011315717     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00212-5     Document Type: Article

References (10)

1. K. Ando, H. Enomoto, A. Saito, Contractible edges in 3-connected graphs, J. Combin. Theory Ser. B 42 (1987) 87-93.
2. K.L. Appel, W. Haken, The existence of unavoidable sets of geographically good configurations, Illinois J. Math. 20 (1976) 218-297.
3. D.W. Barnette, E. Jucovič, Hamiltonian cycles on 3-polytopes, J. Combin. Theory 9 (1970) 54-59.
4. O.V. Borodin, A new proof of the 6 colour theorem, J. Graph Theory (1995) 507-521.
5. O.V. Borodin, Cyclic degree and cyclic coloring of 3-polytopes, J. Graph Theory 23 (1996) 225-231.
6. O.V. Borodin, D.P. Sanders, Y. Zhao, On cyclic colorings and their generalizations, Discrete Math. 203 (1999) 23-40.
7. M. Horňák, S. Jendrol', Unavoidable sets of face types for planar maps, Discussiones Math. Graph Theory 16 (1996) 123-141.
8. T. Jensen, B. Toft, Graph Colouring Problems, Wiley-Interscience, New York, 1995.
9. H. Lebesgue, Quelques conséquences simples de la formule d'Euler, J. Math. Pures Appl. 19 (1940) 27-43.
10. M.D. Plummer, B. Toft, Cyclic coloration of 3-polytopes, J. Graph Theory 11 (1987) 507-515.