Timeline for Does this graph contain at least two Hamiltonian cycles?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2016 at 15:01 | comment | added | user62562 | Is there any analogue of the Claim for the case when you're interested in edge-disjoint Hamilton cycles? e.g. if $G$ is $5$-regular and contains a Hamilton cycle, might it be true that there is always a 2nd Hamilton cycle which shares no edges with the first? (I guess no for trivial edge-connectivity reasons, so maybe rule that out as well.) | |
| Oct 26, 2013 at 2:29 | comment | added | user40096 | Tony Huynh，Thank you very much.In your claim,the condition "$d$-regular" can be turned into "the degree of every vertex is odd". | |
| Oct 26, 2013 at 2:17 | vote | accept | user40096 | ||
| Oct 22, 2013 at 20:59 | history | edited | Tony Huynh | CC BY-SA 3.0 |
edited body; added 16 characters in body
|
| Oct 22, 2013 at 16:45 | history | answered | Tony Huynh | CC BY-SA 3.0 |