| 点关联较少3-面的平面图的全染色 |
| |
| 引用本文： | 孙向勇.点关联较少3-面的平面图的全染色[J].山东大学学报(理学版),2007,42(5):14-18. |
| |
| 作者姓名： | 孙向勇 |
| |
| 作者单位： | 山东经济学院,统计与数学学院,山东,济南,250014;山东大学,系统与科学学院,山东,济南,250100 |
| |
| 摘 要： | 证明了对每点至多关联2个3-面的平面图，全染色猜想成立. 对每点至多关联2个3-面且Δ(G)≥8的平面图，有xT(G)=Δ(G)+1.对每点至多关联Δ(G)/2」个3-面且Δ(G)≥9的平面图，有xT(G)=Δ(G)+1.
|
| 关 键 词： | 平面图 全染色 全染色数 |
| 文章编号： | 1671-9352（2007）05-0014-05 |
| 收稿时间： | 2006-09-29 |
| 修稿时间： | 2006-09-29 |
The total coloring of planar graphs with a few 3-faces incidents with vertex |
| |
| SUN Xiang-yong.The total coloring of planar graphs with a few 3-faces incidents with vertex[J].Journal of Shandong University,2007,42(5):14-18. |
| |
| Authors: | SUN Xiang-yong |
| |
| Institution: | 1. School of Statistics and Math., Shandong Economic Univ., Jinan 250014, Shandong, China; 2. School of Mathematics, Shandong Univ., Jinan 250100, Shandong, China |
| |
| Abstract: | It is proved that for a planar graph G which every vertex is incident with at most two 3-faces, the total coloring conjecture is ture. Moreover, the total chromatic number of G is Δ(G)+1 if Δ(G)≥8. The total chromatic number of a planar graph G is Δ(G)+1 if Δ(G)≥9 and every vertex is incident with at most Δ(G)/2」3-faces. |
| |
| Keywords: | planar graph total coloring total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
