Basavaraju, Manu and Chandran, Sunil L and Cohen, Nathann and Havet, Frederic and Mueller, Tobias (2011) Acyclic Edge-Coloring of Planar Graphs. In: SIAM Journal on Discrete Mathematics, 25 (2). pp. 463-478.
ACYCLIC.pdf - Published Version
Restricted to Registered users only
Download (209Kb) | Request a copy
A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Society for Industrial and Applied Mathematics.|
|Keywords:||edge-coloring;planar graphs;bounded density graphs|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||18 Jul 2011 07:44|
|Last Modified:||18 Jul 2011 07:44|
Actions (login required)