摘要
引入ｎ拟偶图，对ｎ≤３或当ｎ＞３时，剖分边集导出子图为道路、圈、Ｋ１，３的细分图或Ｋ１，３＋ｅ的细分图等情形证明了全着色猜想．
In this paper,the concept of n-quasibipartite graphs is introduced and it is proved that the total chromatic conjecture is true if n≤3.Some special graphs are also studied.
出处
《广西师范大学学报（自然科学版）》
CAS
1995年第2期1-4,共4页
Journal of Guangxi Normal University:Natural Science Edition
关键词
剖分
n拟偶图
全着色
全色数
subdivide
n-quasibipartite graphs
total coloured
total chromatic number
