\((k,g)\)-cages are 3-connected
From MaRDI portal
Publication:1297446
DOI10.1016/S0012-365X(98)00342-2zbMath0927.05050OpenAlexW1979376805MaRDI QIDQ1297446
Publication date: 5 December 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00342-2
Related Items (18)
On the connectivity of cages with girth five, six and eight ⋮ On superconnectivity of (\(4, g\))-cages ⋮ Monotonicity of the order of \((D;g)\)-cages ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter and connectivity of (D; g)-cages ⋮ New improvements on connectivity of cages ⋮ Unnamed Item ⋮ All (k;g)-cages arek-edge-connected ⋮ A new bound for the connectivity of cages ⋮ On superconnectivity of (4,g)-cages with even girth ⋮ The k-conversion number of regular graphs ⋮ Every cubic cage is quasi 4-connected ⋮ On the number of components of \((k,g)\)-cages after vertex deletion ⋮ Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages ⋮ (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected ⋮ Almost all 3-connected graphs contain a contractible set of \(k\) vertices ⋮ Every Cubic Cage is quasi 4-connected
Cites Work
This page was built for publication: \((k,g)\)-cages are 3-connected
