The Distance Matching Extension in K-1,K-k-free Graphs with High Local Connectedness

doi:10.1007/s10255-022-1069-6

CSpace > 应用数学研究所

	The Distance Matching Extension in K-1,K-k-free Graphs with High Local Connectedness
	Liu, Wei-chan1,2 ; Yan, Gui-ying1,2
	2022
发表期刊	ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
ISSN	0168-9673
卷号	38 期号:1 页码:37-43
摘要	A matching is extendable in a graph G if G has a perfect matching containing it. A distance q matching is a matching such that the distance between any two distinct matching edges is at least q. In this paper, we prove that any distance 2k - 3 matching is extendable in a connected and locally (k - 1)-connected K-1,K-k-free graph of even order. Furthermore, we also prove that any distance q matching M in an r-connected and locally (k - 1)-connected K-1,K-k-free graph of even order is extendable provided that divide M divide is bounded by a function on r, k and q. Our results improve some results in [J. Graph Theory 93 (2020), 5-20].
关键词	distance matching extension perfect matching K-1 k-free graph local connectedness
DOI	10.1007/s10255-022-1069-6
收录类别	SCI
语种	英语
资助项目	National Natural Science Foundation of China[11631014] ; National Key Research & Development Program of China[2017YFC0908405]
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000750831700004
出版者	SPRINGER HEIDELBERG
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/59972
专题	应用数学研究所
通讯作者	Yan, Gui-ying
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China 2.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
推荐引用方式 GB/T 7714	Liu, Wei-chan,Yan, Gui-ying. The Distance Matching Extension in K-1,K-k-free Graphs with High Local Connectedness[J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,2022,38(1):37-43.
APA	Liu, Wei-chan,&Yan, Gui-ying.(2022).The Distance Matching Extension in K-1,K-k-free Graphs with High Local Connectedness.ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,38(1),37-43.
MLA	Liu, Wei-chan,et al."The Distance Matching Extension in K-1,K-k-free Graphs with High Local Connectedness".ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES 38.1(2022):37-43.