On equitable and equitable list colorings of seriesparallel graphs

摘要

In this paper, we prove that every seriesparallel graph with maximum degree Δ is equitably k-colorable and equitably k-choosable whenever k≥maxΔ,3.