科研之友
微信
新浪微博
Facebook
分享链接
摘要
An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that no two adjacent vertices are incident to the same set of colors. The minimum number of colors needed for such a coloring is denoted by chi(at)(G). In this note, we prove that chi(at)(G) = 5 for some cubic graphs.
- 出版日期2016-1
- 单位中国计量大学
