Timeline for Hamiltonian cycle on graphs without small cycles
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 18, 2014 at 9:08 | comment | added | joro | The paper contains other NP-hard problems, it will be an answer to the linked question about cyclic graphs. | |
| Jun 17, 2014 at 21:26 | comment | added | Saeed | @MarzioDeBiasi, I think the strongness is about the size of a girth. your proof is about fixed number, accepted answer is for some f(n) which is less than sqrt and this answer is more general than all of them. (IMHO restriction to the graph is not very important here) | |
| Jun 17, 2014 at 18:05 | history | edited | vb le | CC BY-SA 3.0 |
corrected spelling
|
| Jun 17, 2014 at 17:00 | comment | added | Marzio De Biasi | Ok, thanks! I forgot to mention that my proof works for planar undirected bipartite graphs of max-degree 3 ... so the Hourgardy et al. paper is stronger ... but not much stronger :-) :-). I'll probably accept Kristoffer's answer because he posted it first. | |
| Jun 17, 2014 at 16:39 | history | answered | vb le | CC BY-SA 3.0 |