The cubic graphs with finite cyclic vertex connectivity larger than girth
From MaRDI portal
Publication:2214044
DOI10.1016/J.DISC.2020.112197zbMATH Open1462.05201OpenAlexW3097427522MaRDI QIDQ2214044FDOQ2214044
Authors: Jun Liang, Dingjun Lou, Zan-Bo Zhang 
Publication date: 4 December 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112197
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
- Graph theory
- Decompositions and reductions of snarks
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Dynamic cage survey
- On cyclic edge-connectivity of transitive graphs
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- Title not available (Why is that?)
- On cyclic edge-connectivity of fullerenes
- On several sorts of connectivity
- An efficient algorithm for cyclic edge connectivity of regular graphs.
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- Algorithm Theory - SWAT 2004
- A non-Hamiltonian planar graph
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- An improved algorithm for cyclic edge connectivity of regular graphs.
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)
