Title of article
Acyclic edge coloring of sparse graphs
Author/Authors
Wang، نويسنده , , Yingqian and Sheng، نويسنده , , Ping، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
13
From page
3561
To page
3573
Abstract
Let Δ denote the maximum degree of a graph. Fiamčík first, Alon, Sudakov and Zaks later conjectured that every graph is acyclically edge ( Δ + 2 ) -colorable. In this paper, we prove this conjecture for graphs with maximum average degree less than 4. As a corollary, triangle-free planar graphs are acyclically edge ( Δ + 2 ) -colorable.
Keywords
Acyclic edge coloring , maximum average degree , Triangle-Free Planar Graphs
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1600175
Link To Document