The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness

DOI10.1007/s10255-022-1069-6zbMath1484.05167OpenAlexW4210665735MaRDI QIDQ2115210

Weichan Liu, Gui Ying Yan

Publication date: 15 March 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1069-6

zbMATH Keywords

local connectedness\(K_{1k}\)-free graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Matching extension in prism graphs
• Extending matchings in planar graphs. IV
• Matching extension and the genus of a graph
• Matching extension in \(K_{1,r}\)-free graphs with independent claw centers
• Matchings and matching extensions in graphs
• Minimal graphs for matching extensions
• The matching extension problem in general graphs is co-NP-complete
• The matching extendability of optimal 1-planar graphs
• Toughness and matching extension in graphs
• Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
• Graph Theory
• Proximity thresholds for matching extension in planar and projective planar triangulations
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Edge proximity and matching extension in projective planar graphs
• Distance matching extension and local structure of graphs

This page was built for publication: The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness