Indexed by：
Abstract：
A proper edge coloring of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G, denoted by chi(a)＇(G), is the least number of colors in an acyclic edge coloring of G. Let G be a planar graph with maximum degree Delta(G). In this paper, we show that chi(a)＇(G) ＜= Delta(G) + 4, if G contains no 4-cycle; chi(a)＇(G) ＜= Delta(G) + 5, if G contains no intersecting triangles; and chi(a)＇(G) ＜= Delta(G) + 6 if G contains no adjacent triangles. (C) 2011 Elsevier B.V. All rights reserved.
Keyword：
Reprint 's Address：
Version：
Source ：
INFORMATION PROCESSING LETTERS
ISSN： 0020-0190
Year： 2011
Issue： 17
Volume： 111
Page： 836-840
0 . 4 5 5
JCR@2011
0 . 7 0 0
JCR@2023
ESI Discipline： COMPUTER SCIENCE;
JCR Journal Grade：4
CAS Journal Grade：4
Cited Count：
WoS CC Cited Count： 12
SCOPUS Cited Count： 12
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
