摘要
用Discharging方法证明了最大度Δ=6且不含相交三角形的平面图是8全可染的.限于简单平面图,这一结果是对全染色猜想的进一步支持.
It was proved that a plane graph with maximum degree △= 6 and without intersecting triangles were 8 totally colorable by discharging. This result gave further affirmative support to TCC.
出处
《浙江师范大学学报（自然科学版）》
CAS
2007年第4期421-423,共3页
Journal of Zhejiang Normal University:Natural Sciences
关键词
平面图
全染色
相交三角形
最大度
Plane graphs
totally coloring
intersecting triangles
maximum degree
