摘要
An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a'(G) of G is the smallest k such that G has an acyclic edge coloring using k colors.
In this paper, we prove that every planar graph G with girth g(G) and maximum degree Delta has a'(G) = Delta if there exists a pair (k, m) is an element of {(3, 11), (4, 8), (5, 7), (8, 6)} such that G satisfies Delta >= k and g(G) >= m.
- 出版日期2011-7-28
- 单位浙江师范大学