Timeline for How to efficiently find a Hamiltonian cycle in a graph whose closure is complete?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 6, 2014 at 11:04 | vote | accept | Alejandro Erickson | ||
| May 2, 2014 at 0:38 | comment | added | Brendan McKay | If any new edges are removed, the degree sum condition may not be met when cycle edges are removed. That condition is a necessary part of the argument that a new cycle can be found. | |
| May 1, 2014 at 23:21 | comment | added | The Masked Avenger | Why not start by removing all (or half, say) of the new edges not on the cycle? (or even 1/k, where k is the number of new edges on the cycle.) | |
| May 1, 2014 at 22:54 | history | answered | Brendan McKay | CC BY-SA 3.0 |