The cubic graphs with finite cyclic vertex connectivity larger than girth
From MaRDI portal
Publication:2214044
Recommendations
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- The relation between cyclic edge-connectivity and cyclic connectivity of 3-regular connected graphs
- Cyclic vertex connectivity of minimal circulant graphs
- Characterization of graphs with infinite cyclic edge connectivity
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
Cites work
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- A non-Hamiltonian planar graph
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- Algorithm Theory - SWAT 2004
- An efficient algorithm for cyclic edge connectivity of regular graphs.
- An improved algorithm for cyclic edge connectivity of regular graphs.
- Decompositions and reductions of snarks
- Dynamic cage survey
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Graph theory
- Lower bound of cyclic edge connectivity for n-extendability of regular graphs
- On cyclic edge-connectivity of fullerenes
- On cyclic edge-connectivity of transitive graphs
- On several sorts of connectivity
Cited in
(11)- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
- An 11-vertex theorem for 3-connected cubic graphs
- Cycle-regular graphs
- The relation between cyclic edge-connectivity and cyclic connectivity of 3-regular connected graphs
- Connectedness of cubic metacirculant graphs
- Note on reliability of star graphs
- Characterization of graphs with infinite cyclic edge connectivity
- Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs
- Algorithm Theory - SWAT 2004
- Cycle-connected mixed graphs and related problems
- Cycle-connected mixed graphs and related problems
This page was built for publication: The cubic graphs with finite cyclic vertex connectivity larger than girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214044)