科研之友
微信
新浪微博
Facebook
分享链接
摘要
The adaptable chromatic number of a multigraph G, denoted ?a(G), is the smallest integer k such that every edge labeling, t, of G from [k] = {1, 2, ..., k} permits a vertex coloring, s, of G from [k] such that no edge e = uv has t(e) = s(u) = s(v). Hell and Zhu proved that for any multigraph G with maximum degree ?, the adaptable chromatic number is at most . We strengthen this to the asymptotically best possible bound of for any ?>0.
- 出版日期2012-11
