A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685)
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: A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three |
scientific article; zbMATH DE number 7200807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three |
scientific article; zbMATH DE number 7200807 |
Statements
A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (English)
0 references
14 May 2020
0 references
uniquely hamiltonian graphs
0 references
integer linear programming
0 references
stable cycles
0 references
minimum counterexample
0 references
0 references
0.8115178942680359
0 references
0.7796850204467773
0 references
0.7765929698944092
0 references
0.7569781541824341
0 references
