KMS Of Academy of mathematics and systems sciences, CAS
| planargraphswithmaximumdegree8andwithoutintersectingchordal4cyclesare9totallycolorable | |
Cai Jiansheng1; Wang Guanghui2; Yan Guiying3
| |
| 2012 | |
| Source Publication | sciencechinamathematics
 |
| ISSN | 1674-7283 |
| Volume | 55Issue:12Pages:2601 |
| Abstract | 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. |
| Language | 英语 |
| Funding Project | [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] |
| Document Type | 期刊论文 |
| Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/38281 |
| Collection | 应用数学研究所 |
| Affiliation | 1.潍坊学院 2.山东大学 3.中国科学院数学与系统科学研究院 |
| Recommended Citation GB/T 7714 | Cai Jiansheng,Wang Guanghui,Yan Guiying. planargraphswithmaximumdegree8andwithoutintersectingchordal4cyclesare9totallycolorable[J]. sciencechinamathematics,2012,55(12):2601. |
| APA | Cai Jiansheng,Wang Guanghui,&Yan Guiying.(2012).planargraphswithmaximumdegree8andwithoutintersectingchordal4cyclesare9totallycolorable.sciencechinamathematics,55(12),2601. |
| MLA | Cai Jiansheng,et al."planargraphswithmaximumdegree8andwithoutintersectingchordal4cyclesare9totallycolorable".sciencechinamathematics 55.12(2012):2601. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment