Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 31837
The More Organized Proof For Acyclic Coloring Of Graphs With Δ = 5 with 8 Colors

Authors: Ahmad Salehi


An acyclic coloring of a graph G is a coloring of its vertices such that:(i) no two neighbors in G are assigned the same color and (ii) no bicolored cycle can exist in G. The acyclic chromatic number of G is the least number of colors necessary to acyclically color G. Recently it has been proved that any graph of maximum degree 5 has an acyclic chromatic number at most 8. In this paper we present another proof for this result.

Keywords: Acyclic Coloring, Vertex coloring.

Digital Object Identifier (DOI):

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1309


[1] Alon,N; McDiarmid,C; Reed,B. Acyclic colourings of graphs. Random Structures and Algorithms. 2, 277-288,1990.
[2] Borodin,O.V; Kostochka,A.V; Raspaud,A; Sopena,E. Acyclic colouring of 1-planar graphs. Discrete Applied Mathematics. 114(1-3) ,29-41,2001.
[3] Borodin,O.V; Kostochka,A.V; Woodall,D.R. Acyclic colourings of planar graphs with large girth.J. London Math. Soc. 60(2), 344-352,1999.
[4] Borodin,O.V. On acyclic colorings of planar graphs. Discrete Mathematics. 25, 211-236,1979.
[5] Burstein,M.I. Every 4-valent graph has an acyclic 5 coloring (in russian). Soob's'c Akad. Nauk Gruzin. SSR 93, 21-24,1979.
[6] Fertin,G; Godard,E; Raspaud,A. Acyclic and k-distance coloring of the grid. Information Processing Letters. 87(1), 51-58,2003.
[7] Fertin,G; Raspaud,A. Acyclic Coloring of Graphs of Maximum Degree Five:Nine Colors are Enough. Information Processing Letters. 105(2), 65-72,2008.
[8] Grunbaum,B. Acyclic colorings of planar graphs. Israel J.Math. 14(3), 390- 408,1973.
[9] Jamison, R.E; Matthews,G.L; Villalpando,J. Acyclic colorings of products of trees. Information Processing Letters. 99(1), 7-12,2006.
[10] Skulrattanakulchai,S. Acyclic colorings of subcubic graphs. Information Processing Letters. 92(4), 161-167,2004.
[11] Sopena,E. The chromatic number of oriented graphs. Mathematical Notes. 25,191-205,1997.
[12] Yadav,k ; Varagani,s; Kothapalli,k; Venkaiah,V. Ch. Acyclic Vertex Coloring of Graphs of Maximum Degree 5. Proc. of the International Conference on Graph Theory and its Applications,2008, Coimbatore, India. (Under submission to Discrete Mathematics, 2009).