A sufficient condition for planar graphs with maximum degree 6 to be   totally 8-colorable

CORC > 北京大学 > 信息科学技术学院

	A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
	Zhu, Enqiang ; Xu, Jin
刊名	DISCRETE APPLIED MATHEMATICS
	2017
关键词	Planar graph Total coloring 4-fan
DOI	10.1016/j.dam.2017.01.036
英文摘要	It is known that Total Coloring Conjecture (TCC) was verified for planar graphs with maximum degree Delta not equal 6. In this paper, we prove that TCC holds for planar graphs G with Delta(G) = 6, if G does not contain any subgraph isomorphic to a 4-fan. (C) 2017 Elsevier B.V. All rights reserved.; 973 project [2013cb329600]; National Natural Science Foundation of China [61672051, 61309015, 61372191, 61572492]; China Postdoctoral Science Foundation [2015M580928, 2014M560851]; SCI(E); ARTICLE; 148-153; 223
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/473304]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Zhu, Enqiang,Xu, Jin. A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable[J]. DISCRETE APPLIED MATHEMATICS,2017.
APA	Zhu, Enqiang,&Xu, Jin.(2017).A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable.DISCRETE APPLIED MATHEMATICS.
MLA	Zhu, Enqiang,et al."A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable".DISCRETE APPLIED MATHEMATICS (2017).