A new bound for the connectivity of cages
From MaRDI portal
Publication:712582
DOI10.1016/j.aml.2012.01.036zbMath1251.05084MaRDI QIDQ712582
Publication date: 17 October 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2012.01.036
05C38: Paths and cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the connectivity of cages with girth five, six and eight
- On the connectivity of \((k,g)\)-cages of even girth
- Sufficient conditions for maximally connected dense graphs
- \((k,g)\)-cages are 3-connected
- On the order and size of \(s\)-geodetic digraphs with given connectivity
- Dynamic cage survey
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
- (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected
- Cages—a survey
- Maximally connected digraphs