Factor-Critical Graphs with Given Number of Maximum Matchings

CSpace > 应用数学研究所

	Factor-Critical Graphs with Given Number of Maximum Matchings
	Liu, Yan 1; Yan, Guiying2
	2008-11-01
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	24 期号:6 页码:563-569
摘要	A connected graph G is said to be factor-critical if G - nu has a perfect matching for every vertex nu of G. In this paper, the factor-critical graphs G with \|V(G)\| maximum matchings and with \|V(G)\| + 1 ones are characterized, respectively. From this, some special bicritical graphs are characterized.
关键词	Maximum matching factor-critical graph bicritical graph
DOI	10.1007/s00373-008-0816-6
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000261341900007
出版者	SPRINGER TOKYO
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/6330
专题	应用数学研究所
通讯作者	Liu, Yan
作者单位	1.S China Normal Univ, Sch Math, Guangzhou 510631, Guangdong, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Liu, Yan,Yan, Guiying. Factor-Critical Graphs with Given Number of Maximum Matchings[J]. GRAPHS AND COMBINATORICS,2008,24(6):563-569.
APA	Liu, Yan,&Yan, Guiying.(2008).Factor-Critical Graphs with Given Number of Maximum Matchings.GRAPHS AND COMBINATORICS,24(6),563-569.
MLA	Liu, Yan,et al."Factor-Critical Graphs with Given Number of Maximum Matchings".GRAPHS AND COMBINATORICS 24.6(2008):563-569.