Indexed by：
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 chi＇(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. Muller, Acyclic edge-coloring of planar graphs, SIAM journal of Discrete Mathematics 25 (2) (2011)463-478] showed that chi＇(a)(G) ＜= Delta(G) + 12 for any planar graph G with maximum degree Delta(G). In this paper, the bound is improved to Delta(G) + 10. (C) 2013 Elsevier B.V. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
DISCRETE MATHEMATICS
ISSN： 0012-365X
Year： 2013
Issue： 10
Volume： 313
Page： 1098-1103
0 . 5 6 6
JCR@2013
0 . 7 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
JCR Journal Grade：3
CAS Journal Grade：4
Cited Count：
WoS CC Cited Count： 8
SCOPUS Cited Count： 8
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
