Characterizing minimally n-extendable bipartite graphs
From MaRDI portal
Publication:2483409
DOI10.1016/J.DISC.2007.04.056zbMATH Open1154.05042OpenAlexW2082397366MaRDI QIDQ2483409FDOQ2483409
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
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
- 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
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
- Graph theory
- Matching theory
- Title not available (Why is that?)
- On n-extendable graphs
- Extending matchings in graphs: A survey
- Title not available (Why is that?)
- \(M\)-alternating paths in \(n\)-extendable bipartite graphs
- A note on internally disjoint alternating paths in bipartite graphs
- On the structure of minimally \(n\)-extendable bipartite graphs
Cited In (8)
- 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.
- Title not available (Why is that?)
- Title not available (Why is that?)
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)