A survey on the distance-colouring of graphs

Discrete Mathematics

Volumn 308, Issue 2-3, 2008, Pages 422-426

  Kramer, Florica ^a   Kramer, Horst ^a  

^a NONE   (Germany)

Author keywords

Distance colouring; Lattices; Planar graphs

Indexed keywords

COLOR; CRYSTAL LATTICES; MAPPING; MATHEMATICAL MODELS;

DISTANCE-COLOURING; VERTICES;

GRAPH THEORY;

EID: 36249001769     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.11.059     Document Type: Article

References (33)

1. Antonucci S. Generalizzazioni del concetto di cromatismo d'un grafo. Boll. Un. Mat. Ital. (5) 15-B (1978) 20-31
2. Berge C. Graphes et hypergraphes (1970), Dunod, Paris
3. Borodin O.V. On the total coloring of planar graphs. J. Reine Angew. Math. 394 (1989) 180-185
4. M.R. Dillon, Conditional coloring, Doctor Thesis, University of Colorado, Denver, 1998.
5. Fertin G., Godard E., and Raspaud A. Acyclic and k-distance coloring of the grid. Inform. Process. Lett. 87 1 (2003) 51-58
6. Formann M., Hagerup T., Haralambides J., Kaufmann M., Leighton F.T., Symvonis A., Welzl E., and Woeginger G. Drawing graphs in the plane with high resolution. SIAM J. Comput. 22 5 (1993) 1035-1052
7. s d'un grafo finito. Boll. Un. Mat. Ital. (5) 15-A (1978) 444-454
8. s d'un grafo. Riv. Mat. Univ. Parma (4) 6 (1980) 125-133
9. s. Riv. Mat. Univ. Parma (4) 6 (1980) 151-160
10. Gionfriddo M. Un teorema sul numero s-cromatico di un grafo. Atti Soc. Peloritana. Sci. Fis. Mat. Natur. XXVI (1980) 225-232
11. s-colorabile e problemi relativi. Riv. Mat. Univ. Parma (4) 8 (1982) 1-7
12. M. Gionfriddo, Colorazioni generalizzate di un grafo-recenti risultati e probleme aperti, Atti del settimo convegno A.M.A.S.E.S. Acireale 16-18 giugno, 1983, pp. 199-213.
13. Gionfriddo M. A short survey on some generalized colourings of graphs. Ars Combin. 24B (1987) 155-163
14. 2-coloured graphs. Discrete Math. 68 (1988) 107-110
15. s-colourings of directed graphs. Boll. Un. Mat. Ital. (7) 8-A (1994) 283-286
16. van den Heuvel J., and McGuinnes S. Colouring the square of a planar graph. J. Graph Theory 42 (2003) 110-124
17. Jacko P., and Jendrol S. Distance coloring of the hexagonal lattice. Discuss. Math. Graph Theory 25 (2005) 151-166
18. Jagger C. Distant vertex partitions of graphs. Combin. Prob. Comput. 7 (1998) 413-422
19. Jendrol S., and Skupień Z. Local structures in plane maps and distance colourings. Discrete Math. 236 (2001) 167-177
20. Jensen T.R., and Toft B. Graph Coloring Problems (1995), Wiley, New York
21. Kramer F. Sur le nombre chromatique K (p, G) des graphes. RAIRO R-1 (1972) 67-70
22. Kramer F., and Kramer H. Un probleme de coloration des sommets d'un graphe. C.R. Acad. Sci. Paris A 268 (1969) 46-48
23. Kramer F., and Kramer H. Ein Färbungsproblem der Knotenpunkte eines Graphen bezüglich der Distanz p. Rev. Roumaine Math. Pures Appl. 14 2 (1969) 1031-1038
24. Kramer F., and Kramer H. On the generalized chromatic number. Ann. Discrete Math. 30 (1986) 275-284
25. 4-minor free graph. Discrete Math. 269 (2003) 303-309
26. M. Molloy, M.R. Salavatipour, Frequency channel assignment on planar networks, in: Proceedings of ESA 2002, Lecture Notes in Computer Science, Vol. 2461, Springer, Berlin, pp. 736-747.
27. Molloy M., and Salavatipour M.R. A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B 94 (2005) 189-213
28. A. Sevcikova, Distant chromatic number of the planar graphs, Manuscript, Safarik University, 2001.
29. Speranza F. Colorazioni di specie superiore d'un grafo. Boll. Un. Mat. Ital. (4) 12 (1975) 53-62
30. C. Thomassen, Applications of Tutte cycles, Technical Report, Department of Mathematics, Technical University of Denmark, September 2001.
31. G. Wegner, Graphs with given diameter and a colouring problem, Technical Report, University of Dortmund, 1977.
32. J. Wojciechowski, Long induced cycles in the hypercube and colourings of graphs, Trinity College, A Dissertation for the Degree of Doctor of Philosophy of the University of Cambridge, April 1990.
33. S.A. Wong, Colouring graphs with respect to distance, M.Sc. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, 1996.