Vertex colorings with a distance restriction

Discrete Mathematics

Volumn 191, Issue 1-3, 1998, Pages 65-82

  Chen, Guantao ^a   Gyárfás, András ^b   Schelp, R H ^c  

^a GEORGIA STATE UNIVERSITY   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c University of Memphis   (United States)

Author keywords

Chromatic number; Coloring; Distance; Extremal number

Indexed keywords

EID: 0043098229     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00094-6     Document Type: Article

References (10)

1. G. Chartrand, Lesniak, Graphs & Digraphs, Wadsworth Inc., Belmont, CA, 1986.
2. B. Grünbaum, Acyclic colorings of planar graphs, Israel J. Math. 14 (1973) 390-408.
3. M. Horňák, S. Jendrol, On some properties of 4-regular plane graphs, J. Graph Thoery 20 (2) (1995) 163-175.
4. M. Horňák, S. Jendrol, On the d-distance face chromatic number of plane graphs, Discrete Math., to appear.
5. C. Jagger, Distant vertex partitions of graphs, Comb. Prob. Comput., submitted.
6. S. Jendrol, Z. Skupień, On the vertex-edge distance colourings of planar graphs, preprint.
7. F. Kramer, Sur le nombre chromatique K(p, G) des graphes, Rev. Francaise Automat. Informat. Recherche Opérationnelle, Sér. R-1, 6 (1972) 67-70.
8. F. Kramer, H. Kramer, On the generalized chromatic number, Combinatorics '84, Proc. Int. Conf. Finite Geom. Comb. Struct., Bari, Italy, 1984 (Ann. Discrete Math. 30 (1986) 275-284).
9. D.P. Sanders, Y. Zhao, On d-diagonal colorings, J. Graph Th., to appear.
10. Z. Skupieň, Some maximum multigraphs and edge-vertex distance colourings, Discuss. Math-Graph Theory 15 (1995) 89-106.