Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647717 | Discrete Mathematics | 2013 | 10 Pages |
Abstract
A graph G is equitably k-choosable if, for any given k-uniform list assignment L, G is L-colorable and each color appears on at most â|V(G)|kâ vertices. A graph is said to be equitably k-colorable if the vertex set V(G) can be partitioned into k independent subsets V1,V2,â¦,Vk such that ||Vi|â|Vj||â¤1(1â¤i,jâ¤k). In this paper, we prove that every planar graph G without 4-cycles is equitably k-choosable and equitably k-colorable where kâ¥max{Î(G),6}, which improves several recent results.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Aijun Dong, Guojun Li, Guanghui Wang,