On the chromatic uniqueness of the graph W(n,n-2,k)

CSpace

	On the chromatic uniqueness of the graph W(n,n-2,k)
	Dong, FM; Liu, YP
	1996
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	12 期号:3 页码:221-230
摘要	This paper shows that the graph W(n,n - 2,k) is chromatically unique for any even integer n greater than or equal to 6 and any integer k greater than or equal to 1.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:A1996VF98100002
出版者	SPRINGER VERLAG
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/28740
专题	中国科学院数学与系统科学研究院
作者单位	CHINESE ACAD SCI,INST APPL MATH,BEIJING 100080,PEOPLES R CHINA
推荐引用方式 GB/T 7714	Dong, FM,Liu, YP. On the chromatic uniqueness of the graph W(n,n-2,k)[J]. GRAPHS AND COMBINATORICS,1996,12(3):221-230.
APA	Dong, FM,&Liu, YP.(1996).On the chromatic uniqueness of the graph W(n,n-2,k).GRAPHS AND COMBINATORICS,12(3),221-230.
MLA	Dong, FM,et al."On the chromatic uniqueness of the graph W(n,n-2,k)".GRAPHS AND COMBINATORICS 12.3(1996):221-230.