Article ID Journal Published Year Pages File Type
4648461 Discrete Mathematics 2011 4 Pages PDF
Abstract

In this paper, we prove that every series–parallel graph with maximum degree ΔΔ is equitably kk-colorable and equitably kk-choosable whenever k≥max{Δ,3}k≥max{Δ,3}.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On equitable and equitable list colorings of series–parallel graphs
Authors
, ,