Smallest cubic graphs with prescribed properties (Q801931)
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: Smallest cubic graphs with prescribed properties |
scientific article; zbMATH DE number 3880747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Smallest cubic graphs with prescribed properties |
scientific article; zbMATH DE number 3880747 |
Statements
Smallest cubic graphs with prescribed properties (English)
0 references
1984
0 references
Consider the four properties of cubic graphs; 2-connected, planar, bipartite, hamiltonian. Considering both possibilities for each of these, we get sixteen combined properties. After noting that six of these cannot occur, we determine the smallest possible cubic graphs for each of the remaining ten cases.
0 references
cubic graphs
0 references
combined properties
0 references
0.9018869
0 references
0.8920493
0 references
0.88920575
0 references
0 references
0.8817512
0 references
0 references
0.8780705
0 references
0.8759917
0 references
