科研之友
微信
新浪微博
Facebook
分享链接
摘要
A graph is said to be equitably k-colorable if the vertex set V(G) can be partitioned into k independent subsets V-1,V-2 , . . . , V-k such that parallel to V-i vertical bar < vertical bar V-j parallel to <= 1, (1 <= i, j <= k). 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 vertical bar V(G)/k vertical bar vertices. In this paper, we prove that if G is a graph such that mad(G) < 3, then G is equitably k-colorable and equitably k-choosable where k >= max{Delta(G), 4}. Moreover, if G is a graph such that mad(G) < 12/5, then G is equitably k-colorable and equitably k-choosable where k >= max{Delta(G), 3}.
- 出版日期2018
- 单位西安电子科技大学; 山东交通学院
