Characterizing minimally n-extendable bipartite graphs

DOI10.1016/J.DISC.2007.04.056MaRDI QIDQ2483409zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the structure of minimally \(n\)-extendable bipartite graphs
• A novel characterization of \(n\)-extendable bipartite graphs.
• Minimum degree of minimal defect \(n\)-extendable bipartite graphs
• scientific article; zbMATH DE number 5926313
• Construction characterizations for defect \(n\)-extendable bipartite graphs
• On extremal bipartite graphs with a given connectivity
• scientific article; zbMATH DE number 637274
• scientific article; zbMATH DE number 1093015
• Characterizing defect n-extendable bipartite graphs with different connectivities

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1161241 (Why is no real title available?)
• A note on internally disjoint alternating paths in bipartite graphs
• Extending matchings in graphs: A survey
• Graph theory
• Matching theory
• On n-extendable graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs

Cited in

(8)

• scientific article; zbMATH DE number 5532004 (Why is no real title available?)
• Characterizing defect n-extendable bipartite graphs with different connectivities
• Characterization of \(2\)-minimally nonouterplanar join graphs
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• A note on internally disjoint alternating paths in bipartite graphs
• A characterization of PM-compact bipartite and near-bipartite graphs
• A novel characterization of \(n\)-extendable bipartite graphs.
• scientific article; zbMATH DE number 5720940 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483409)