Forbidden induced subgraphs for perfect matchings

DOI10.1007/s00373-011-1102-6zbMath1263.05078OpenAlexW2069592076MaRDI QIDQ1950397

Katsuhiro Ota, Gabriel Sueiro

Publication date: 13 May 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1102-6

zbMATH Keywords

perfect matchingforbidden subgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Forbidden induced subgraphs for near perfect matchings ⋮ Forbidden subgraphs and the existence of a spanning tree without small degree stems ⋮ A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity ⋮ Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian ⋮ Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph ⋮ Minimal forbidden sets for degree sequence characterizations

Cites Work

• Unnamed Item
• Unnamed Item
• Forbidden induced subgraphs for near perfect matchings
• Forbidden induced subgraphs for star-free graphs
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden triples for perfect matchings
• 1-Factors and Antifactor Sets
• Forbidden subgraphs and bounds on the size of a maximum matching
• The Factorization of Linear Graphs

This page was built for publication: Forbidden induced subgraphs for perfect matchings