On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs (Q6303161): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:26, 10 July 2024
scientific article; zbMATH DE number 900352101
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs |
scientific article; zbMATH DE number 900352101 |
Statements
15 June 2018
0 references
math.CO
0 references
