摘要
本文证明了极大平面图g9D和g12A,其每个四着色的每个二色子图都是路.并猜测在全部无分离三圈的极大平面图中这是仅有的两个图.
In this planar graphs gOD planar graphs. paper, it is proved and g12A is a path. that every bichromatic subgrap We conjecture that there is not h of every 4-coloring any other graph in all of maximal of maximal
出处
《中央民族大学学报(自然科学版)》
2005年第1期5-9,共5页
Journal of Minzu University of China(Natural Sciences Edition)
关键词
四色问题
四着色算法
极大平面图
二色子图
色多项式
four color problem
four coloring algorithm
maximal planar graph
bichromatic subgraph
chromatic polynomial