Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647767 | Discrete Mathematics | 2013 | 6 Pages |
Abstract
A proper edge coloring of a graph G is called acyclic if there is no bichromatic cycle in G. The acyclic chromatic index of G, denoted by Ïaâ²(G), is the least number of colors k such that G has an acyclic k-edge-coloring. Basavaraju et al. [M. Basavaraju, L.S. Chandran, N. Cohen, F. Havet and T. Müller, Acyclic edge-coloring of planar graphs, SIAM Journal of Discrete Mathematics 25 (2) (2011) 463-478] showed that Ïaâ²(G)â¤Î(G)+12 for any planar graph G with maximum degree Î(G). In this paper, the bound is improved to Î(G)+10.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yue Guan, Jianfeng Hou, Yingyuan Yang,