科研之友
微信
新浪微博
Facebook
分享链接
摘要
A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one. The equitable chromatic threshold chi(eq)*(G) of G is the smallest integer m such that G is equitably n-colorable for all n >= m. We show that for planar graphs G with minimum degree at least two, chi(eq)*(G) <= 4 if the girth of G is at least 10, and chi(eq)*(G) <= 3 if the girth of G is at least 14.
- 出版日期2010
