An efficient algorithm for cyclic edge connectivity of regular graphs.
From MaRDI portal
Recommendations
- An improved algorithm for cyclic edge connectivity of regular graphs.
- The relation between cyclic edge-connectivity and cyclic connectivity of 3-regular connected graphs
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- Algorithm Theory - SWAT 2004
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
Cited in
(17)- The \(k\)-subconnectedness of planar graphs
- The cubic graphs with finite cyclic vertex connectivity larger than girth
- Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs
- A polynomial algorithm for cyclic edge connectivity of cubic graphs
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
- An improved algorithm for cyclic edge connectivity of regular graphs.
- A square time algorithm for cyclic edge connectivity of planar graphs.
- scientific article; zbMATH DE number 4083681 (Why is no real title available?)
- Characterization of \(k\)-subconnected graphs
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- A note on cyclic connectivity and matching properties of regular graphs
- The relation between cyclic edge-connectivity and cyclic connectivity of 3-regular connected graphs
- Spectral threshold for extremal cyclic edge-connectivity
- Characterization of graphs with infinite cyclic edge connectivity
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- Algorithm Theory - SWAT 2004
- Polynomial time algorithms for two classes of subgraph problem
This page was built for publication: An efficient algorithm for cyclic edge connectivity of regular graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408856)
