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 k -colorable and equitably k -choosable whenever k ≥ max { Δ , 3 } .