Forbidden induced subgraphs for perfect matchings

DOI10.1007/S00373-011-1102-6MaRDI QIDQ1950397zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

perfect matchingforbidden subgraph

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3492724 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• 1-Factors and Antifactor Sets
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden induced subgraphs for near perfect matchings
• Forbidden induced subgraphs for star-free graphs
• Forbidden subgraphs and bounds on the size of a maximum matching
• Forbidden triples for perfect matchings
• The Factorization of Linear Graphs

Cited in

(13)

• Perfect matchings avoiding several independent edges in a star-free graph
• Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
• Forbidden induced subgraphs of double-split graphs
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs.
• On non-trivial families without a perfect matching
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden induced subgraphs for near perfect matchings
• Two forbidden induced subgraphs and well-quasi-ordering
• Forbidden triples for perfect matchings
• Forbidden subgraphs and the existence of a spanning tree without small degree stems
• Pairs of forbidden induced subgraphs for homogeneously traceable graphs
• Minimal forbidden sets for degree sequence characterizations

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)