On equitable and equitable list colorings of series–parallel graphs

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}.