Title of article :
Equitable colorings of planar graphs with maximum degree at least nine
Author/Authors :
Nakprasit، نويسنده , , Kittikorn، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2012
Pages :
6
From page :
1019
To page :
1024
Abstract :
In [Y. Zhang, H.P. Yap, Equitable colorings of planar graphs, J. Combin. Math. Conbin. Comput. 27 (1998) 97–105], Zhang and Yap essentially proved that each planar graph with maximum degree Δ at least 13 has an equitable Δ -coloring. In this paper, we proved that each planar graph in various classes has an equitable Δ -coloring, especially planar graphs with maximum degree 9, 10, 11, and 12. Consequently, each planar graph with maximum degree Δ at least 9 has an equitable Δ -coloring.
Keywords :
Planar graphs , Equitable colorings
Journal title :
Discrete Mathematics
Serial Year :
2012
Journal title :
Discrete Mathematics
Record number :
1599887
Link To Document :
بازگشت