A pair of forbidden subgraphs and perfect matchings

Shinya Fujita, Ken ichi Kawarabayashi, Claudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito

研究成果: Article査読

27 被引用数 (Scopus)

抄録

In this paper, we study the relationship between forbidden subgraphs and the existence of a matching. Let H be a set of connected graphs, each of which has three or more vertices. A graph G is said to be H-free if no graph in H is an induced subgraph of G. We completely characterize the set H such that every connected H-free graph of sufficiently large even order has a perfect matching in the following cases. (1)Every graph in H is triangle-free.(2) H consists of two graphs (i.e. a pair of forbidden subgraphs).A matching M in a graph of odd order is said to be a near-perfect matching if every vertex of G but one is incident with an edge of M. We also characterize H such that every H-free graph of sufficiently large odd order has a near-perfect matching in the above cases.

本文言語English
ページ(範囲)315-324
ページ数10
ジャーナルJournal of Combinatorial Theory. Series B
96
3
DOI
出版ステータスPublished - 2006 5月

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 離散数学と組合せ数学
  • 計算理論と計算数学

フィンガープリント

「A pair of forbidden subgraphs and perfect matchings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル