科研之友
微信
新浪微博
Facebook
分享链接
摘要
A proper edge coloring of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a'(G), is the least number of colors in an acyclic edge coloring of G. Alon et al. conjectured that a'(
- 出版日期2009-3
- 单位山东大学
