Two sufficient conditions for dominating cycles

CSpace

	Two sufficient conditions for dominating cycles
	Lu, M ; Liu, HQ ; Tian, F
	2005-06-01
发表期刊	JOURNAL OF GRAPH THEORY
ISSN	0364-9024
卷号	49 期号:2 页码:135-150
摘要	A cycle C of a graph G is dominating if each component of G\C is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3-connected graph to be a dominating cycle. © 2005 Wiley Periodicals, Inc.
关键词	dominating cycle connectivity insertible vertex
DOI	10.1002/jgt.20070
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000229099900004
出版者	JOHN WILEY & SONS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/1670
专题	中国科学院数学与系统科学研究院
通讯作者	Lu, M
作者单位	1.Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Lu, M,Liu, HQ,Tian, F. Two sufficient conditions for dominating cycles[J]. JOURNAL OF GRAPH THEORY,2005,49(2):135-150.
APA	Lu, M,Liu, HQ,&Tian, F.(2005).Two sufficient conditions for dominating cycles.JOURNAL OF GRAPH THEORY,49(2),135-150.
MLA	Lu, M,et al."Two sufficient conditions for dominating cycles".JOURNAL OF GRAPH THEORY 49.2(2005):135-150.