摘要
应用构造染色法研究了图P_n^3和C_n^2的Mycielski图的邻点可区别I-全染色,并得到了其邻点可区别I-全色数,进一步验证了图的邻点可区别I-全染色猜想.
The paper applies the structure staining method to study the adjacent vertex-distinguishing I-total coloring of Mycielski graph of P_n^3 and C_n^2. And the adjacent vertex-distinguishing I-total chromatic of Mycielski graph of P_n^3 and C_n^2 is obtained thereby. The conjecture of the adjacent vertex-distinguishing I-total coloring graph is further verified in this paper.
出处
《温州大学学报(自然科学版)》
2017年第1期30-38,共9页
Journal of Wenzhou University(Natural Science Edition)
基金
国家自然科学基金(11401038)
关键词
k方图
MYCIELSKI图
邻点可区别I-全染色
邻点可区别I-全色数
K-square Graph
Mycielski Graph
Adjacent Vertex-distinguishing I-total Coloring
Adjacent Vertex-distinguishing I-total Chromatic Number