New improvements on connectivity of cages
From MaRDI portal
Publication:546369
DOI10.1007/s10114-011-8279-8zbMath1222.05131MaRDI QIDQ546369
Qinglin Yu, Hongliang Lu, Yu-qing Lin, Yun Jian Wu
Publication date: 24 June 2011
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-011-8279-8
05C40: Connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification of regular planar graphs with diameter two
- 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
- A note on the edge-connectivity of cages
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
- (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected
- Moore graphs and beyond: a survey of the degree/diameter problem
- Cages—a survey
- Maximally connected digraphs
- Edge-superconnectivity of cages
- All (k;g)-cages arek-edge-connected
- All (k;g)‐cages are edge‐superconnected