Timeline for NP completeness of Hamiltonian cycle for the family of *dual graphs* to plane, cubic, triply connected graphs?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 28, 2019 at 10:28 | comment | added | Gamow | @Lorenzo: Yes, that's fine with me. It it is enough to refer to a "discussion on stackexchange" plus html. | |
| Jun 28, 2019 at 7:45 | comment | added | Elle Najt | Your answer here and your comments on a few other questions of mine (notably this one: cstheory.stackexchange.com/questions/41998/… ) helped me to move a research project forward. Now that it is wrapping up I would like to acknowledge your input. I would like to respect your right to keep your identity anonymous, so I am referring to you as Gamow with a link your stackexchange profile. If you would like me to acknowledge you differently or to discuss this further, please contact me at [email protected]. | |
| Aug 27, 2018 at 5:52 | comment | added | David Eppstein | In fact the duals of cubic 3-connected graphs are exactly the maximal planar graphs. | |
| Aug 26, 2018 at 15:06 | vote | accept | Elle Najt | ||
| Aug 26, 2018 at 8:49 | history | answered | Gamow | CC BY-SA 4.0 |