The complexity of finding a second Hamiltonian cycle in cubic graphs (Q1307702)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1359930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding a second Hamiltonian cycle in cubic graphs |
scientific article; zbMATH DE number 1359930 |
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
0.9266153573989868
0 references
0.9130645394325256
0 references
0.8979487419128418
0 references
0.8280352354049683
0 references
