A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2020.125233 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3017170238 / rank | |||
Normal rank | |||
Revision as of 14:35, 19 March 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
