摘要
研究单圈Cn',一类单圈图G以及它们与完全图Km联图Cn'∨Kn,G∨Kn的全染色问题.借助于已知的完全图全染色的相关引理以及归纳总结的方法得出了Cn',G的全色数以及其与完全图联图Cn'∨Kn,G∨Kn的全色数,从而验证了对这类图全染色猜想的正确性.
In this paper, the total chromatic number of Cn, CCn∨Kn,G∨Kn are obtained by using some lemmas of the total coloring of complete graph and inductive method, in which Cn, is a circle and K,, is a complete graph, and G is a unicyclic graph . Thus, total chromatic number conjecture is verified by this kind of graph.
出处
《合肥学院学报（自然科学版）》
2012年第3期21-23,34,共4页
Journal of Hefei University :Natural Sciences
关键词
单圈图
完全图
联图
边色数
全色数
unicyclie graph
complete graph
join graph
edge chromatic number
total chromatic number
