CSpace  > 应用数学研究所
planargraphswithmaximumdegree8andwithoutintersectingchordal4cyclesare9totallycolorable
Cai Jiansheng1; Wang Guanghui2; Yan Guiying3
2012-01-01
发表期刊sciencechinamathematics
ISSN1674-7283
卷号55期号:12页码:2601
摘要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]
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/38281
专题应用数学研究所
作者单位1.潍坊学院
2.山东大学
3.中国科学院数学与系统科学研究院
推荐引用方式
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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Cai Jiansheng]的文章
[Wang Guanghui]的文章
[Yan Guiying]的文章
百度学术
百度学术中相似的文章
[Cai Jiansheng]的文章
[Wang Guanghui]的文章
[Yan Guiying]的文章
必应学术
必应学术中相似的文章
[Cai Jiansheng]的文章
[Wang Guanghui]的文章
[Yan Guiying]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。