\((k,g)\)-cages are 3-connected (Q1297446): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((k,g)\)-cages are 3-connected |
scientific article |
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
