CSpace  > 应用数学研究所
Cai Jiansheng1; Wang Guanghui2; Yan Guiying3
Source Publicationsciencechinamathematics
AbstractThe 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.
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期刊论文
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.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Cai Jiansheng]'s Articles
[Wang Guanghui]'s Articles
[Yan Guiying]'s Articles
Baidu academic
Similar articles in Baidu academic
[Cai Jiansheng]'s Articles
[Wang Guanghui]'s Articles
[Yan Guiying]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Cai Jiansheng]'s Articles
[Wang Guanghui]'s Articles
[Yan Guiying]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.