An 11-vertex theorem for 3-connected cubic graphs (Q3824445)
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 4097425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An 11-vertex theorem for 3-connected cubic graphs |
scientific article; zbMATH DE number 4097425 |
Statements
An 11-vertex theorem for 3-connected cubic graphs (English)
0 references
1988
0 references
3-connected cubic graph
0 references
cycle
0 references
0.8941172
0 references
0.88728935
0 references
0.87612635
0 references
0.8754926
0 references
0 references
0 references
0.8702961
0 references
0.86787635
0 references
0.86692464
0 references
