Forbidden induced subgraphs for near perfect matchings

DOI10.1016/J.DISC.2013.01.020zbMath1277.05140OpenAlexW2034017255MaRDI QIDQ385401

Gabriel Sueiro, Katsuhiro Ota, Kenta Ozeki

Publication date: 2 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.01.020

zbMATH Keywords

perfect matchingforbidden subgraphnear perfect matching

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 (2)

Forbidden induced subgraphs for perfect matchings ⋮ Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian

Cites Work

• Matching theory
• Forbidden induced subgraphs for perfect matchings
• A pair of forbidden subgraphs and perfect matchings.
• Unnamed Item

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