Some new results about the shortness exponent in polyhedral graphs (Q3783323)
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 4045788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some new results about the shortness exponent in polyhedral graphs |
scientific article; zbMATH DE number 4045788 |
Statements
1987
0 references
3-polytopes
0 references
Hamiltonian circuit
0 references
shortness exponent
0 references
maximal length of a circuit
0 references
regular graphs
0 references
Some new results about the shortness exponent in polyhedral graphs (English)
0 references
0.8888797163963318
0 references
0.8673749566078186
0 references
0.8652119040489197
0 references
