摘要
研究了没有4圈,5圈和共点三角形的平面图的结构,利用这个结构,证明了这类图是3-可染色的。它加强了Borodin、Sanders和Zhao证明的结果,并且又是对Steinberg猜想的一个支持。
In this paper,we studied the structure of plane graphs without 4,5 circuits and intersecting triangles.As a corollary,we proved that such graphs are 3-colorable.This strengthened the results of Borodin,Sanders and Zhao,and also provided a positive support to Steinberg's conjecture.
出处
《青岛农业大学学报(自然科学版)》
2011年第1期75-78,共4页
Journal of Qingdao Agricultural University(Natural Science)
关键词
平面图
3-染色
圈
Plane graph
3-coloring
Circuit