\((k,g)\)-cages are 3-connected
From MaRDI portal
Publication:1297446
DOI10.1016/S0012-365X(98)00342-2zbMath0927.05050MaRDI QIDQ1297446
Publication date: 5 December 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
05C40: Connectivity
Related Items
All (k;g)-cages arek-edge-connected, On the connectivity of cages with girth five, six and eight, On the connectivity of \((k,g)\)-cages of even girth, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Every cubic cage is quasi 4-connected, Almost all 3-connected graphs contain a contractible set of \(k\) vertices, Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages, (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected, Every Cubic Cage is quasi 4-connected
Cites Work