Construction for bicritical graphs and \(k\)-extendable bipartite graphs
From MaRDI portal
Publication:2497479
DOI10.1016/j.disc.2005.12.025zbMath1095.05029OpenAlexW2044545593MaRDI QIDQ2497479
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.025
Related Items (8)
The extendability of matchings in strongly regular graphs ⋮ The matching extension problem in general graphs is co-NP-complete ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Algorithms for (0, 1,d)-graphs withdconstrains ⋮ 2-extendability of toroidal polyhexes and Klein-bottle polyhexes ⋮ Matching theory and Barnette's conjecture ⋮ The characterization of \(p\)-factor-critical graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial algorithm for the extendability problem in bipartite graphs
- A note on the number of perfect matchings of bipartite graphs
- Brick decompositions and the matching rank of graphs
- Matching theory
- Matching structure and the matching lattice
- On n-extendable graphs
- Matching theory -- a sampler: From Dénes König to the present
- On minimal elementary bipartite graphs
- Extending matchings in graphs: A survey
- Brace generation
- Finding the edge connectivity of directed graphs
- On a Family of Planar Bicritical Graphs
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Covering Problems: Duality Relations and a New Method of Solution
- On the structure of factorizable graphs
This page was built for publication: Construction for bicritical graphs and \(k\)-extendable bipartite graphs
