A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:20, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three |
scientific article |
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
