Odd wheels in graphs

	Odd wheels in graphs
	Xu, BG; Jin, GP; Liu, ZH
发表期刊	JOURNAL OF COMBINATORIAL THEORY SERIES B
摘要	For k greater than or equal to 1 the odd it-heel of 2k + 1 spokes, denoted by W2k+1 is the graph obtained from a cycle of length 2k + 1 by adding a new vertex and joining it to all vertices of the cycle. In this paper it is shown that if a graph G of order n with minimum degree greater than 7n/12 is at least 4-chromatic then G contains an odd wheel with at most 5 spokes. (C) 2001 Elsevier Science (USA).
	2002
卷号	84 期号:2 页码:12,213-224
ISSN	0095-8956
学科领域	Mathematics
收录类别	SCI
语种	英语
WOS记录号	WOS:000174627100003
引用统计	被引频次：1[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.casisd.cn/handle/190111/5335
专题	中国科学院科技政策与管理科学研究所(1985年6月-2015年12月) 系统分析与管理研究所
推荐引用方式 GB/T 7714	Xu, BG,Jin, GP,Liu, ZH. Odd wheels in graphs[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,2002,84(2):12,213-224.
APA	Xu, BG,Jin, GP,&Liu, ZH.(2002).Odd wheels in graphs.JOURNAL OF COMBINATORIAL THEORY SERIES B,84(2),12,213-224.
MLA	Xu, BG,et al."Odd wheels in graphs".JOURNAL OF COMBINATORIAL THEORY SERIES B 84.2(2002):12,213-224.