Acyclic edge coloring of graphs


An acyclic edge coloring of a graph G 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 acyclic chromatic index χa(G) of a graph G is the least number of colors needed in any acyclic edge coloring of G. Fiamčík (1978) conjectured that χa(G) ≤ ∆(G) + 2… (More)
DOI: 10.1016/j.dam.2013.12.001


  • Presentations referencing similar topics