Papers
Topics
Authors
Recent
Search
2000 character limit reached

Acyclic edge coloring of graphs

Published 11 Feb 2013 in math.CO and cs.DM | (1302.2405v4)

Abstract: An {\em acyclic edge coloring} of a graph GG is a proper edge coloring such that the subgraph induced by any two color classes is a linear forest (an acyclic graph with maximum degree at most two). The {\em acyclic chromatic index} $\chiup_{a}'(G)$ of a graph GG is the least number of colors needed in an acyclic edge coloring of GG. Fiam\v{c}\'{i}k (1978) conjectured that $\chiup_{a}'(G) \leq \Delta(G) + 2$, where Δ(G)\Delta(G) is the maximum degree of GG. This conjecture is well known as Acyclic Edge Coloring Conjecture (AECC). A graph GG with maximum degree at most κ\kappa is {\em κ\kappa-deletion-minimal} if $\chiup_{a}'(G) > \kappa$ and $\chiup_{a}'(H) \leq \kappa$ for every proper subgraph HH of GG. The purpose of this paper is to provide many structural lemmas on κ\kappa-deletion-minimal graphs. By using the structural lemmas, we firstly prove that AECC is true for the graphs with maximum average degree less than four (\autoref{NMAD4}). We secondly prove that AECC is true for the planar graphs without triangles adjacent to cycles of length at most four, with an additional condition that every $5$-cycle has at most three edges contained in triangles (\autoref{NoAdjacent}), from which we can conclude some known results as corollaries. We thirdly prove that every planar graph GG without intersecting triangles satisfies $\chiup_{a}'(G) \leq \Delta(G) + 3$ (\autoref{NoIntersect}). Finally, we consider one extreme case and prove it: if GG is a graph with Δ(G)≥3\Delta(G) \geq 3 and all the 3+3^{+}-vertices are independent, then $\chiup_{a}'(G) = \Delta(G)$. We hope the structural lemmas will shed some light on the acyclic edge coloring problems.

Authors (2)
Citations (14)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.