\((k,g)\)-cages are 3-connected (Q1297446)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \((k,g)\)-cages are 3-connected |
scientific article; zbMATH DE number 1321804
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((k,g)\)-cages are 3-connected |
scientific article; zbMATH DE number 1321804 |
Statements
\((k,g)\)-cages are 3-connected (English)
0 references
5 December 1999
0 references
A \(k\)-regular graph of girth \(g\) which has the smallest number of vertices among all \(k\)-regular graphs of girth \(g\) is called a \((k,g)\)-cage. The authors show that all cages are 3-connected.
0 references
connectivity
0 references
cage
0 references
