典型文献
The Distance Matching Extension in K1,k-free Graphs with High Local Connectedness
文献摘要：
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 K1,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 K1,k-free graph of even order is extendable provided that |M| is bounded by a function on r,k and q.Our results improve some results in[J.Graph Theory 93(2020),5-20].
文献关键词：
中图分类号：
作者姓名：
Wei-chan LIU;Gui-ying YAN
作者机构：
Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,China;University of Chinese Academy of Sciences,Beijing 100049,China
文献出处：
引用格式：
[1]Wei-chan LIU;Gui-ying YAN-.The Distance Matching Extension in K1,k-free Graphs with High Local Connectedness)[J].应用数学学报（英文版）,2022(01):37-43
A类：
B类：
Distance,Matching,Extension,K1,free,Graphs,High,Local,Connectedness,matching,extendable,graph,if,has,perfect,containing,distance,such,that,between,any,two,distinct,edges,least,In,this,paper,2k,connected,locally,even,order,Furthermore,also,provided,bounded,by,function,Our,results,improve,some,Theory
AB值：
0.487199
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
