Edge proximity conditions for extendability in regular bipartite graphs
From MaRDI portal
Publication:6094028
Recommendations
Cites work
- scientific article; zbMATH DE number 4066957 (Why is no real title available?)
- scientific article; zbMATH DE number 19207 (Why is no real title available?)
- scientific article; zbMATH DE number 4114690 (Why is no real title available?)
- scientific article; zbMATH DE number 867631 (Why is no real title available?)
- Edge proximity conditions for extendability in cubic bipartite graphs
- Lower bound of cyclic edge connectivity for n-extendability of regular graphs
- On n-extendable graphs
- On the structure of minimally \(n\)-extendable bipartite graphs
- \(M\)-alternating paths in \(n\)-extendable bipartite graphs
Cited in
(5)- Edge Proximity Conditions for Extendability in Planar Triangulations
- Edge proximity and matching extension in projective planar graphs
- Essential Constraints of Edge-Constrained Proximity Graphs
- Distance matching extension in cubic bipartite graphs
- Edge proximity conditions for extendability in cubic bipartite graphs
This page was built for publication: Edge proximity conditions for extendability in regular bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094028)