CSpace  > 应用数学研究所
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
其他题名Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
Cai JianSheng1; Wang GuangHui2; Yan GuiYing3
2012
发表期刊Science China Mathematics,
ISSN1674-7283
卷号55期号:12页码:2601-2612
摘要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.
其他摘要Abstract(#br)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 ζ″ ( G ). It is shown that if a planar graph G has maximum degree Δ ? 9, then ζ ″ ( G ) = Δ + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without intersecting chordal 4-cycles, then ζ″ ( G ) = 9.
关键词TOTAL COLORINGS 6-CYCLES total coloring planar graph chordal 4-cycles triangles
收录类别CSCD
语种英语
资助项目[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
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/56014
专题应用数学研究所
作者单位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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Cai JianSheng]的文章
[Wang GuangHui]的文章
[Yan GuiYing]的文章
百度学术
百度学术中相似的文章
[Cai JianSheng]的文章
[Wang GuangHui]的文章
[Yan GuiYing]的文章
必应学术
必应学术中相似的文章
[Cai JianSheng]的文章
[Wang GuangHui]的文章
[Yan GuiYing]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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