Acyclic and k-distance coloring of the grid

Information Processing Letters

Volumn 87, Issue 1, 2003, Pages 51-58

  Fertin, Guillaume ^a   Godard, Emmanuel ^b   Raspaud, André ^b  

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Acyclic coloring; d dimensional grids; Graph algorithms; Hypercubes; k distance coloring

Indexed keywords

ALGORITHMS; NUMBER THEORY; NUMERICAL METHODS;

ACYCLIC COLORING;

GRAPH THEORY;

EID: 0038247993     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00232-1     Document Type: Article

References (8)

1. Alon N., Mohar B. The chromatic number of graph powers. Combin. Probab. Comput. 11:2002;1-10.
2. Borodin O.V., Kostochka A.V., Woodall D.R. Acyclic colourings of planar graphs with large girth. J. London Math. Soc. 60:(2):1999;344-352.
3. Borodin O.V. On acyclic colorings of planar graphs. Discrete Math. 25:1979;211-236.
4. Burstein M.I. Every 4-valent graph has an acyclic 5 coloring. Soobshch. Akad. Nauk Gruzin. SSR. 93:1979;21-24. (in Russian).
5. G. Fertin, A. Raspaud, B. Reed, Star coloring of graphs, LaBRI, Technical Report, 2002, Submitted for publication.
6. Grünbaum B. Acyclic colorings of planar graphs. Israel J. Math. 14:(3):1973;390-408.
7. Kim D.S., Du D.-Z., Pardalos P.M. A coloring problem on the n-cube. Discrete Appl. Math. 103:2000;307-311.
8. Sopena E. The chromatic number of oriented graphs. Math. Notes. 25:1997;191-205.