Acyclic 3-coloring of generalized Petersen graphs

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

	Acyclic 3-coloring of generalized Petersen graphs
	Zhu, Enqiang ; Li, Zepeng ; Shao, Zehui ; Xu, Jin ; Liu, Chanjuan
刊名	JOURNAL OF COMBINATORIAL OPTIMIZATION
	2016
关键词	Acyclic coloring Generalized Petersen graphs Cubic graphs Triconnectivity EVERY PLANAR GRAPH
DOI	10.1007/s10878-014-9799-9
英文摘要	An acyclic -coloring of a graph is a -coloring of its vertices such that no cycle of is bichromatic. is called acyclically -colorable if it admits an acyclic -coloring. In this paper, we prove that the generalized Petersen graph is acyclically 3-colorable except and the classical Petersen graph P(5, 2).; 973 Projects [2013CB32960, 2013CB329602, 2010CB328103]; National Natural Science Foundation of China [61127005, 60974112, 30970960]; SCI(E); EI; ARTICLE; zhuenqiang@pku.edu.cn; 2; 902-911; 31
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/437712]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Zhu, Enqiang,Li, Zepeng,Shao, Zehui,et al. Acyclic 3-coloring of generalized Petersen graphs[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2016.
APA	Zhu, Enqiang,Li, Zepeng,Shao, Zehui,Xu, Jin,&Liu, Chanjuan.(2016).Acyclic 3-coloring of generalized Petersen graphs.JOURNAL OF COMBINATORIAL OPTIMIZATION.
MLA	Zhu, Enqiang,et al."Acyclic 3-coloring of generalized Petersen graphs".JOURNAL OF COMBINATORIAL OPTIMIZATION (2016).