Forbidden induced subgraphs for near perfect matchings

Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro

研究成果: Article査読

1 被引用数 (Scopus)

抄録

Let F be a family of connected graphs. A graph G is said to be F-free if G is H-free for every graph H in F. Fujita et al. (2006) [2] studied the problem of characterizing the families of graphs F such that every large enough connected F-free graph of odd order has a near perfect matching. In the same work, the authors characterized such families F, but in the case where every graph in F is triangle-free. In this paper, we complete the characterization of all such families, removing the triangle-free condition.

本文言語English
ページ(範囲)1267-1280
ページ数14
ジャーナルDiscrete Mathematics
313
11
DOI
出版ステータスPublished - 2013

ASJC Scopus subject areas

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

フィンガープリント

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

引用スタイル