@article{7994a59b29cd49e7bf085f89635cf53f,
title = "A note on relaxed equitable coloring of graphs",
abstract = "In this note we introduce the concept of equitable d-relaxed coloring. We prove that each graph with maximum degree at most r admits an equitable 1-relaxed r-coloring and provide a polynomial-time algorithm for constructing such a coloring.",
keywords = "Deficit coloring, Equitable coloring, Graph algorithms, Relaxed coloring",
author = "Hao Fan and Henry Kierstead and Guizhen Liu and Theodore Molla and Wu, {Jian Liang} and Xin Zhang",
note = "Funding Information: E-mail addresses: ferretjoke@hotmail.com (H. Fan), kierstead@asu.edu (H.A. Kierstead), gzliu@sdu.edu.cn (G. Liu), tmolla@asu.edu (T. Molla), jlwu@sdu.edu.cn (J.-L. Wu), sdu.zhang@yahoo.com.cn (X. Zhang). 1 Research of the author supported in part by NSA grant MDA 904-03-1-0007 and NSF grant DMS-0901520. 2 Research of the author supported in part by NSFC grant 61070230. 3 Research of the author supported in part by NSFC grant 10971121. 4 Research of the author supported in part by NSFC grant 11101243, RFDP grant 20100131120017 and GIIFSDU grant yzc10040.",
year = "2011",
month = dec,
day = "15",
doi = "10.1016/j.ipl.2011.08.001",
language = "English (US)",
volume = "111",
pages = "1062--1066",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "21-22",
}