Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call