A result of acyclic edge coloring of planar graphs without shorts cycles
Zhang Geng · Journal of Guizhou Normal College · 2012
In this paper,we did some researches on the acyclic edge coloring of planar graphs with discharging methods and proved that if is a planar graph with maximum degree 5 and without 3 and 4 cycles,its acyclic chromatic number is no more than.