Forbidden triples for perfect matchings | Zendy

Ota Katsuhiro | Zendy; Plummer, Michael D. | Zendy; Saito Akira | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Forbidden triples for perfect matchings

Author(s) -

Ota Katsuhiro,

Plummer, Michael D.,

Saito Akira

Publication year - 2011

Publication title -

journal of graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 54

eISSN - 1097-0118

pISSN - 0364-9024

DOI - 10.1002/jgt.20529

Subject(s) - combinatorics , mathematics , distance hereditary graph , factor critical graph , graph , line graph , induced subgraph , perfect graph theorem , perfect graph , discrete mathematics , voltage graph , graph power , vertex (graph theory)

Let ℋ be a set of connected graphs. A graph is said to be ℋ‐ free if it does not contain any member of ℋ 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 ℋ with |ℋ|⩽2 such that every connected ℋ‐free graph of sufficiently large even order has a perfect matching. Extending this line of research, we give the characterization in the case of |ℋ|⩽3. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 250–259, 2011

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research