Forbidden triples for perfect matchings

Katsuhiro Ota, Michael D. Plummer, Akira Saito

研究成果: Article査読

6 被引用数 (Scopus)

抄録

Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. Plummer and Saito [J Graph Theory 50 (2005), 1-12] and Fujita et al. [J Combin Theory Ser B 96 (2006), 315-324] characterized all H with |H|≤2 such that every connected H-free graph of sufficiently large even order has a perfect matching. Extending this line of research, we give the characterization in the case of |H|≤3.

本文言語English
ページ(範囲)250-259
ページ数10
ジャーナルJournal of Graph Theory
67
3
DOI
出版ステータスPublished - 2011 7

ASJC Scopus subject areas

  • Geometry and Topology

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

引用スタイル