\((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 the normal view instead:
scientific article; zbMATH DE number 1321804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9470608830451964
0 references
0.9354888796806335
0 references
0.9243586659431458
0 references
0.9119123220443726
0 references
