کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4648219 1342398 2012 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Equitable colorings of planar graphs with maximum degree at least nine
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Equitable colorings of planar graphs with maximum degree at least nine
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 312, Issue 5, 6 March 2012, Pages 1019–1024
نویسندگان
,