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
Source PublicationACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
ISSN0168-9673
Volume38Issue:1Pages:37-43
AbstractA 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].
Keyworddistance matching extension perfect matching K-1 k-free graph local connectedness
DOI10.1007/s10255-022-1069-6
Indexed BySCI
Language英语
Funding ProjectNational Natural Science Foundation of China[11631014] ; National Key Research & Development Program of China[2017YFC0908405]
WOS Research AreaMathematics
WOS SubjectMathematics, Applied
WOS IDWOS:000750831700004
PublisherSPRINGER HEIDELBERG
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/59972
Collection应用数学研究所
Corresponding AuthorYan, Gui-ying
Affiliation1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
2.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Liu, Wei-chan]'s Articles
[Yan, Gui-ying]'s Articles
Baidu academic
Similar articles in Baidu academic
[Liu, Wei-chan]'s Articles
[Yan, Gui-ying]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Liu, Wei-chan]'s Articles
[Yan, Gui-ying]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.