asufficientconditionforplanargraphswithmaximumdegree8tobe9totallycolorable

CSpace > 应用数学研究所

	asufficientconditionforplanargraphswithmaximumdegree8tobe9totallycolorable
	Cai Jiansheng 1; Teng Changchun 1; Yan Guiying2
	2014
发表期刊	actamathematicasinicaenglishseries
ISSN	1439-8516
卷号	30 期号:6 页码:993
摘要	A total k-coloring of a graph G is a coloring of V (G) a(a) E(G) using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number chi aEuro(3)(G) is the smallest integer k such that G has a total k-coloring. It is known that if a planar graph G has maximum degree Delta a parts per thousand yen 9, then chi aEuro(3)(G) = Delta+1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without a fan of four adjacent 3-cycles, then chi aEuro(3)(G) = 9.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/41340
专题	应用数学研究所
作者单位	1.潍坊学院 2.中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Cai Jiansheng,Teng Changchun,Yan Guiying. asufficientconditionforplanargraphswithmaximumdegree8tobe9totallycolorable[J]. actamathematicasinicaenglishseries,2014,30(6):993.
APA	Cai Jiansheng,Teng Changchun,&Yan Guiying.(2014).asufficientconditionforplanargraphswithmaximumdegree8tobe9totallycolorable.actamathematicasinicaenglishseries,30(6),993.
MLA	Cai Jiansheng,et al."asufficientconditionforplanargraphswithmaximumdegree8tobe9totallycolorable".actamathematicasinicaenglishseries 30.6(2014):993.