Forbidden induced subgraphs for perfect matchings
DOI10.1007/S00373-011-1102-6zbMATH Open1263.05078OpenAlexW2069592076MaRDI QIDQ1950397FDOQ1950397
Authors: 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
Recommendations
- Forbidden induced subgraphs for near perfect matchings
- Forbidden triples for perfect matchings
- A pair of forbidden subgraphs and perfect matchings.
- A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
- Perfect matchings avoiding several independent edges in a star-free graph
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- The Factorization of Linear Graphs
- A pair of forbidden subgraphs and perfect matchings.
- Title not available (Why is that?)
- 1-Factors and Antifactor Sets
- Forbidden subgraphs and bounds on the size of a maximum matching
- Forbidden induced subgraphs for near perfect matchings
- Forbidden induced subgraphs for star-free graphs
- Forbidden triples for perfect matchings
Cited In (11)
- Two forbidden induced subgraphs and well-quasi-ordering
- A pair of forbidden subgraphs and perfect matchings.
- Pairs of forbidden induced subgraphs for homogeneously traceable graphs
- A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
- Forbidden induced subgraphs of double-split graphs
- Minimal forbidden sets for degree sequence characterizations
- Perfect matchings avoiding several independent edges in a star-free graph
- Forbidden induced subgraphs for near perfect matchings
- Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian
- Forbidden triples for perfect matchings
- Forbidden subgraphs and the existence of a spanning tree without small degree stems
This page was built for publication: Forbidden induced subgraphs for perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950397)
