1Alon N,McDiarmid C J H,Reed B. Acyclic coloring of graphs[ J ]. Random Structures & Algorithms,1991,2( 3 ) :277 - 288.
2Molly M, Reed B. Further algorithmic aspects of the local lenuna [ C ]//Jeffrey Vitter. Proceedings of the 30th Annual ACM Symposium on Theory of Computing. New York: ACM, 1998:524 - 529.
3Alon N,Sudakov B,Zaks A. Acyclic edge colorings of graphs[J].Journal of Graph Theory,2001,37(3) :157 - 167.
4Skulrattanakulchai S. Acyclic colorings of subcubic graphs [ J ]. Information Processing Letters ,2004,92 (4) :161 -167.
5Manu B ,Chandran L S. Acyclic edge coloring of graphs with maximum degree four[J]. Journal of Graph Theory,2009,61 (3) :192 -209.
6Fiedorowicz A, Haluszczak M, Narsynan N. About acyclic edge colourings of planar graphs [ J ]. Information Processing Letters,2008,108 (6) :412 - 417.
7Wei Dong,Xu Bao -gang. Some results on scyclic edge coloring of planar graphs [ J ]. Information Processing Letters, 2010,110(20) :887 -892.
8Hou Jian - feng, Liu Gui - zhen, Wang Guang - hui. Improved bounds for acyclic chromatic index of planar graphs[ J ]. Discrete Applied MathematiCs,2011,159 (8) :876 - 881.
