Title of article
On equitable and equitable list colorings of series–parallel graphs
Author/Authors
Zhang، نويسنده , , Xin and Wu، نويسنده , , Jian-Liang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
4
From page
800
To page
803
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 } .
Keywords
Series–parallel graphs , Equitable coloring , Equitable list coloring
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1598407
Link To Document