Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
文献类型：期刊论文
| 作者 | Cai JianSheng2; Wang GuangHui1; Yan GuiYing3
|
| 刊名 | Science China Mathematics,
 |
| 出版日期 | 2012 |
| 卷号 | 55期号:12页码:2601-2612 |
| 关键词 | TOTAL COLORINGS 6-CYCLES total coloring planar graph chordal 4-cycles triangles |
| ISSN号 | 1674-7283 |
| 其他题名 | Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable |
| 英文摘要 | The minimum number of colors needed to properly color the vertices and edges of a graph G is called the total chromatic number of G and denoted by chi ''(G). It is shown that if a planar graph G has maximum degree Delta >= 9, then chi ''(G) = Delta + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without intersecting chordal 4-cycles, then chi ''(G) = 9. |
| 资助项目 | [Natural Science Foundation of Shandong Province] ; [Scientific Research Foundation for the Excellent Middle-Aged and Youth Scientists of Shandong Province] ; [National Natural Science Foundation of China] |
| 语种 | 英语 |
| CSCD记录号 | CSCD:4716800 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/56013]  |
| 专题 | 应用数学研究所 |
| 作者单位 | 1.山东大学 2.潍坊学院 3.中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Cai JianSheng,Wang GuangHui,Yan GuiYing. Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable[J]. Science China Mathematics,,2012,55(12):2601-2612. |
| APA | Cai JianSheng,Wang GuangHui,&Yan GuiYing.(2012).Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable.Science China Mathematics,,55(12),2601-2612. |
| MLA | Cai JianSheng,et al."Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable".Science China Mathematics, 55.12(2012):2601-2612. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。