A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: plantri / rank | |||
Normal rank | |||
Revision as of 21:22, 29 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
