Local structures in plane maps and distance colourings

Discrete Mathematics

Volumn 236, Issue 1-3, 2001, Pages 167-177

  Jendrol', Stanislav ^a   Skupień, Zdzisław ^b  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

^b AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

Author keywords

Distance colourings; Planar graphs; Plane maps; t Distance chromatic number

Indexed keywords

EID: 0035815967     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00440-4     Document Type: Article

References (24)

1. P. Baldi, On a generalized family of colourings, Graphs Combin. 6 (1990) 95-110.
2. O.V. Borodin, Joint colouring of vertices, edges and faces of plane graphs, Metody Diskret. Anal. 47 (1988) 27-37 (in Russian).
3. O.V. Borodin, Joint generalization of theorems by Lebesgue and Kotzig, Diskret. Mat. 3 (1991) 24-27 (in Russian).
4. O.V. Borodin, D.P. Sanders, Y. Zhao, On cyclic colorings and their generalizations, Discrete Math. 203 (1999) 23-40.
5. A. Chen, A. Gyárfás, R.H. Schelp, Vertex coloring with a distance restrictions, Discrete Math. 191 (1998) 83-90.
6. R.J. Faudree, R.H. Schelp, A. Gyárfás, Zs. Tuza, The strong chromatic index of graphs, Ars Combin. B29 (1990) 205-211.
7. M. Fellows, P. Hell, K. Seyffarth, Constructions of dense planar networks, manuscript, 1993.
8. M. Fellows, P. Hell, K. Seyffarth, Large planar graphs with given diameter and maximum degree, Discrete Appl. Math. 61 (1995) 133-153.
9. J.-L. Fouquet, J.-L. Jolivet, Strong edge-colourings of graphs and applications to multi-k-gons, Ars Combin. A16 (1983) 141-150.
10. J.-L. Fouquet, J.-L. Jolivet, Strong edge-colouring of cubic planar graphs, in: Progress in Graph Theory (Waterloo, Ont., 1982) Acad. Press, Toronto, Ont., 1984, pp. 247-264.
11. P. Hell, K. Seyffarth, Largest planar graphs of diameter two and fixed maximum degree, Discrete Math. 111 (1993) 313-322.
12. M. Horňák, S. Jendrol', On some properties of 4-regular plane graphs, J. Graph Theory 20 (1995) 163-175.
13. M. Horňák, S. Jendrol', On the d-distance face chromatic number of plane graphs, Discrete Math. 164 (1997) 171-174.
14. T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995.
15. A. Kotzig, Contribution to the theory of Eulerian polyhedra, Mat. Čas. SAV 5 (1955) 233-237, (Slovak).
16. F. Kramer, H. Kramer, Un problème de coloration des sommets d'un graphe, C.R. Acad. Sci. Paris Sér. A-B 268 (1969) A46-A48.
17. F. Kramer, H. Kramer, On the generalized chromatic number, Combinatorics '84 (Bari, Italy) North-Holland Mathematical Studies, Vol. 123, North-Holland, Amsterdam, New York, 1986 (and Ann. Discrete Math. 30 (1986)) 275-284.
18. F. Kramer, H. Kramer, On the generalized chromatic number, Combinatorics '84 (Bari, Italy) North-Holland Mathematical Studies, Vol. 123, North-Holland, Amsterdam, New York, 1986 (and Ann. Discrete Math. 30 (1986)) 275-284.
19. H. Lebesgue, Quelques conséquences simples de la formule d'Euler, J. Math. Pures Appl. (9) 19 (1940) 27-43.
20. D.P. Sanders, Y. Zhao, On d-diagonal colorings, J. Graph Theory 22 (1996) 155-166.
21. D.P. Sanders, Y. Zhao, On d-diagonal colorings of embedded graphs of low maximum face size, Graphs combin. 14 (1998) 81-94.
22. Z. Skupień, Some maximum multigraphs and chromatic d-index, in: U. Faigle, C. Hoede (Eds.), Third Twente workshop on Graphs and combinatorial Optimization (Fac. Appl. Math. Univ. Twente, Enschede, 1993) pp. 173-175.
23. Z. Skupień, Some maximum multigraphs and edge/vertex distance colourings, Discuss. Math. Graph Theory 15 (1995) 89-106.
24. Colloquio Internazionale sulle Teorie combinatorie. (Proceedings of International Colloquim, Rome, 1973), Academia Nazionale dei Lincei, Rome, 1976.