A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
文献类型：期刊论文
| 作者 | Cai Jian Sheng1; Teng Chang Chun1; Yan Gui Ying2 |
| 刊名 | ACTA MATHEMATICA SINICA-ENGLISH SERIES
 |
| 出版日期 | 2014 |
| 卷号 | 30期号:6页码:993-1006 |
| 关键词 | TOTAL CHROMATIC NUMBER TOTAL COLORINGS Total coloring planar graph a fan of four adjacent 3-cycles |
| ISSN号 | 1439-8516 |
| 其他题名 | A Sufficient Condition for Planar Graphs with Maximum Degree 8 to Be 9-totally Colorable |
| 英文摘要 | A total k-coloring of a graph G is a coloring of V (G) a(a) E(G) using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number chi aEuro(3)(G) is the smallest integer k such that G has a total k-coloring. It is known that if a planar graph G has maximum degree Delta a parts per thousand yen 9, then chi aEuro(3)(G) = Delta+1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without a fan of four adjacent 3-cycles, then chi aEuro(3)(G) = 9. |
| 语种 | 英语 |
| CSCD记录号 | CSCD:5129732 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/54815]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.潍坊学院 2.中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Cai Jian Sheng,Teng Chang Chun,Yan Gui Ying. A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable[J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES,2014,30(6):993-1006. |
| APA | Cai Jian Sheng,Teng Chang Chun,&Yan Gui Ying.(2014).A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable.ACTA MATHEMATICA SINICA-ENGLISH SERIES,30(6),993-1006. |
| MLA | Cai Jian Sheng,et al."A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable".ACTA MATHEMATICA SINICA-ENGLISH SERIES 30.6(2014):993-1006. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。