Forbidden triples for perfect matchings

DOI10.1002/jgt.20529zbMath1225.05203OpenAlexW2054582076MaRDI QIDQ3018077

Michael D. Plummer, Katsuhiro Ota, Akira Saito

Publication date: 21 July 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20529

zbMATH Keywords

perfect matchingforbidden subgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Forbidden set of induced subgraphs for 2-connected supereulerian graphs ⋮ Forbidden induced subgraphs for perfect matchings ⋮ Pairs of forbidden induced subgraphs for homogeneously traceable graphs ⋮ 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

• Forbidden triples and traceability: A characterization
• Characterizing forbidden pairs for hamiltonian properties
• Traceability in graphs with forbidden triples of subgraphs
• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Forbidden triples for Hamiltonicity
• A pair of forbidden subgraphs and perfect matchings.
• 1-Factors and Antifactor Sets
• Forbidden subgraphs and bounds on the size of a maximum matching
• The Factorization of Linear Graphs
• Unnamed Item

This page was built for publication: Forbidden triples for perfect matchings