The complexity of finding a second Hamiltonian cycle in cubic graphs (Q1307702): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:23, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding a second Hamiltonian cycle in cubic graphs |
scientific article |
Statements
The complexity of finding a second Hamiltonian cycle in cubic graphs (English)
0 references
9 November 1999
0 references
cubic graph
0 references
Hamiltonian cycles
0 references
