Forbidden subgraphs and bounds on the size of a maximum matching
From MaRDI portal
Publication:5318238
DOI10.1002/jgt.20087zbMath1070.05070OpenAlexW4242738205MaRDI QIDQ5318238
Akira Saito, Michael D. Plummer
Publication date: 22 September 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20087
Related Items (12)
Forbidden subgraphs generating a finite set ⋮ A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity ⋮ Forbidden induced subgraphs for perfect matchings ⋮ Forbidden triples for perfect matchings ⋮ A pair of forbidden subgraphs and perfect matchings. ⋮ Forbidden subgraphs and the existence of a 2-factor ⋮ Deficiency and forbidden subgraphs of connected, locally-connected graphs ⋮ The Ryjáček closure and a forbidden subgraph ⋮ Perfect matchings avoiding prescribed edges in a star-free graph ⋮ Vertex-disjoint stars in \(K_{1 , r}\)-free graphs ⋮ Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph ⋮ Forbidden pairs for \(k\)-connected Hamiltonian graphs
This page was built for publication: Forbidden subgraphs and bounds on the size of a maximum matching
