跳到主要导航 跳到搜索 跳到主要内容

Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3

  • Zhihao Hui
  • , Junfeng Du
  • , Shipeng Wang*
  • , Liming Xiong
  • , Xiaojing Yang
  • *此作品的通讯作者
  • Pingdingshan University
  • Beijing University of Chemical Technology
  • Jiangsu University
  • Beijing Institute of Technology

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

Let H be a set of connected graphs. A graph G is said to be H-free if G does not contain any member of H as an induced subgraph. A graph G having a perfect matching is called k-extendable if every matching of size k in G can be extended to a perfect matching. In this paper, we characterize the sets H with |H|=2 such that every (k+1)-connected H-free graph G of sufficiently large order permitting a perfect matching is k-extendable for k∈{1,2}.

源语言英语
期刊论文编号111694
期刊Discrete Mathematics
卷343
期4
DOI
出版状态已出版 - 4月 2020

学术指纹

探究 'Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3' 的科研主题。它们共同构成独一无二的学术指纹。

引用此