The Acyclic Coloring of Meredith Graphs and Series-Parallel Graphs
Zhang Wei-biao · Journal of Sichuan Normal University · 2011
An acyclic coloring of a graph is a proper coloring such that there are no bichromatic cycles.In this paper,the acyclic coloring chromatic index of Meredith graphs and series-parallel graphs is studied.It is proved that a(G)≤Δ(G)+1 for series-parallel graphs with Δ(G)≥5.