Timeline for Is there a 2-connected k-regular graph without Hamiltonian path?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23, 2016 at 12:23 | answer | added | Sebastien Palcoux | timeline score: 6 | |
| Jun 22, 2016 at 23:58 | vote | accept | Sebastien Palcoux | ||
| Jun 22, 2016 at 22:51 | comment | added | Gerry Myerson | There is some discussion of $k=3$ at cstheory.stackexchange.com/questions/4190/… | |
| Jun 22, 2016 at 22:49 | comment | added | Gerry Myerson | The ArXiv version of the cited paper is at arxiv.org/pdf/1204.6457.pdf | |
| Jun 22, 2016 at 22:44 | comment | added | Gerry Myerson | Did you want a counterexample for some $k$? or a counterexample for each $k$? | |
| Jun 22, 2016 at 21:52 | answer | added | Fedor Petrov | timeline score: 15 | |
| Jun 22, 2016 at 21:46 | answer | added | mhum | timeline score: 8 | |
| Jun 22, 2016 at 20:13 | history | asked | Sebastien Palcoux | CC BY-SA 3.0 |