Timeline for Graph classes where Hamiltonian Cycle and Hamiltonian Path problems have different complexity
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 14, 2020 at 9:30 | answer | added | JimN | timeline score: 2 | |
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Dec 18, 2013 at 22:31 | history | edited | Mohammad Al-Turkistany | CC BY-SA 3.0 |
added 120 characters in body
|
| Dec 18, 2013 at 21:09 | answer | added | David E Speyer | timeline score: 3 | |
| Dec 18, 2013 at 21:09 | comment | added | Michal R. Przybylek | Take the class of graphs that have at least one vertex of degree 1. The complexity of HC is constant on this class, whereas HP is NPC. | |
| Dec 18, 2013 at 20:33 | history | edited | Mohammad Al-Turkistany | CC BY-SA 3.0 |
added 3 characters in body
|
| Dec 18, 2013 at 20:28 | history | asked | Mohammad Al-Turkistany | CC BY-SA 3.0 |