Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
From MaRDI portal
Publication:1210558
DOI10.1016/0012-365X(93)90229-MzbMath0788.05062MaRDI QIDQ1210558
Publication date: 30 August 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (22)
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ CYCLIC CONNECTIVITY OF STAR GRAPH ⋮ Super cyclically edge-connected vertex-transitive graphs of girth at least 5 ⋮ Super-cyclically edge-connected regular graphs ⋮ Note on reliability of star graphs ⋮ Perfect matchings in highly cyclically connected regular graphs ⋮ Edge proximity conditions for extendability in regular bipartite graphs ⋮ Super cyclically edge connected transitive graphs ⋮ A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs ⋮ \(M\)-alternating paths in \(n\)-extendable bipartite graphs ⋮ The cubic graphs with finite cyclic vertex connectivity larger than girth ⋮ A note on the cyclical edge-connectivity of fullerene graphs ⋮ On the 2-extendability of planar graphs ⋮ On cyclic edge-connectivity of fullerenes ⋮ Extending matchings in planar graphs. IV ⋮ Characterization of graphs with infinite cyclic edge connectivity ⋮ N‐extendability of symmetric graphs ⋮ Atoms of cyclic edge connectivity in regular graphs ⋮ A note on cyclic connectivity and matching properties of regular graphs ⋮ Spectral threshold for extremal cyclic edge-connectivity ⋮ On the structure of minimally \(n\)-extendable bipartite graphs ⋮ Extending matchings in graphs: A survey
Cites Work
- Matching theory
- The asymptotic distribution of short cycles in random regular graphs
- The asymptotic connectivity of labelled regular graphs
- On n-extendable graphs
- The asymptotic number of labeled graphs with given degree sequences
- Cages—a survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs