Timeline for Enumerating all Hamiltonian Cycles in a Bipartite Vertex Transitive Graph
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2011 at 6:30 | comment | added | Gerhard Paseman | There is no strict custom. If this question receives another answer that you feel is even more acceptable, you (should be able to) may accept that answer instead. Gerhard "Ask Me About System Design" Paseman, 2011.11.17 | |
| Nov 18, 2011 at 2:32 | comment | added | Ng Yong Hao | On a side note, I suppose answer acceptance process in MathOverflow is to select one as soon as you see a suitable candidate and switch as better ones appear? I cannot seem to locate the FAQ for this. | |
| Nov 18, 2011 at 2:30 | vote | accept | Ng Yong Hao | ||
| Nov 25, 2011 at 12:44 | |||||
| Nov 18, 2011 at 2:30 | vote | accept | Ng Yong Hao | ||
| Nov 18, 2011 at 2:30 | |||||
| Nov 18, 2011 at 2:23 | comment | added | Ng Yong Hao | Thanks for the reply. I certainly think these ideas will help. Currently, I am exploring the symmetries as what you mentioned. | |
| Nov 17, 2011 at 6:35 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |