Monotonicity of the order of (D;g)-cages
From MaRDI portal
Recommendations
Cites work
- (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected
- \((k,g)\)-cages are 3-connected
- Cages—a survey
- Connectivity of cages
- Constructions of bi-regular cages
- Degree sets for graphs
- Diameter and connectivity of (D; g)-cages
- Dynamic cage survey
- Graphs with prescribed degree sets and girth
- scientific article; zbMATH DE number 3769656 (Why is no real title available?)
- scientific article; zbMATH DE number 1286481 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- scientific article; zbMATH DE number 2188443 (Why is no real title available?)
- scientific article; zbMATH DE number 3256347 (Why is no real title available?)
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- scientific article; zbMATH DE number 3046496 (Why is no real title available?)
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
- On cages with given degree sets
- On the connectivity of cages with girth five, six and eight
- On the order of \((\{r,m\};g)\)-cages of even girth
- The minimum number of vertices with girth 6 and degree set \(D=\{r,m\}\)
Cited in
(5)
This page was built for publication: Monotonicity of the order of \((D;g)\)-cages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654223)
