(2, k)-Factor-critical graphs and toughness

CSpace

	(2, k)-Factor-critical graphs and toughness
	Cai, MC ; Favaron, O ; Li, H
	1999
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	15 期号:2 页码:137-142
摘要	A graph is (r, k)-factor-critical if the removal of any set of k vertices results in a graph with an r-factor (i.e. with an r-regular spanning subgraph). We show that every tau-tough graph of order n with tau greater than or equal to 2 is (2,k)-factor-critical for every non-negative integer k less than or equal to min{2 tau - 2, n - 3}, thus proving a conjecture as well as generalizing the main result of Liu and Yu in [4].
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000081517700002
出版者	SPRINGER VERLAG
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14484
专题	中国科学院数学与系统科学研究院
作者单位	1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 2.Univ Paris Sud, LRI, F-91405 Orsay, France
推荐引用方式 GB/T 7714	Cai, MC,Favaron, O,Li, H. (2, k)-Factor-critical graphs and toughness[J]. GRAPHS AND COMBINATORICS,1999,15(2):137-142.
APA	Cai, MC,Favaron, O,&Li, H.(1999).(2, k)-Factor-critical graphs and toughness.GRAPHS AND COMBINATORICS,15(2),137-142.
MLA	Cai, MC,et al."(2, k)-Factor-critical graphs and toughness".GRAPHS AND COMBINATORICS 15.2(1999):137-142.