Characterizing minimally \(n\)-extendable bipartite graphs

DOI10.1016/j.disc.2007.04.056zbMath1154.05042OpenAlexW2082397366MaRDI QIDQ2483409

Dingjun Lou

Publication date: 28 April 2008

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

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

zbMATH Keywords

bipartite graph\(n\)-extendable graph\(M\)-alternating pathminimally \(n\)-extendable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• On n-extendable graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Extending matchings in graphs: A survey
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• A note on internally disjoint alternating paths in bipartite graphs

This page was built for publication: Characterizing minimally \(n\)-extendable bipartite graphs