Super cyclically edge connected transitive graphs
From MaRDI portal
Publication:411230
DOI10.1007/s10878-010-9304-zzbMath1263.90119MaRDI QIDQ411230
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9304-z
edge-transitive; vertex-transitive; cyclic edge-connectivity; cyclic edge-cut; super cyclically edge-connected
90C35: Programming involving graphs or networks
Related Items
On the reliability of modified bubble-sort graphs, Atoms of cyclic edge connectivity in regular graphs, Super \(s\)-restricted edge-connectivity of vertex-transitive graphs, On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs, Some results about the reliability of folded hypercubes, Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs, Matching preclusion for cube-connected cycles, Super cyclically edge-connected vertex-transitive graphs of girth at least 5, Super-cyclically edge-connected regular graphs
Cites Work
- On cyclic edge-connectivity of transitive graphs
- On the 2-extendability of planar graphs
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- Minimal Cyclic-4-Connected Graphs
- Connectivity of transitive graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item