Timeline for Hamiltonian paths on the space of graphs
Current License: CC BY-SA 4.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 26, 2019 at 4:18 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
removed uniqueness criterion
|
Jun 25, 2019 at 23:44 | vote | accept | Aidan Rocke | ||
Jun 25, 2019 at 11:33 | comment | added | Aidan Rocke | @GordonRoyle I just clarified the question. I meant that all edges are the same except one which is relocated. | |
Jun 25, 2019 at 11:31 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
clarified question
|
Jun 25, 2019 at 11:26 | comment | added | Gordon Royle | If you go from one graph to another that “differs in one edge” then they can’t both have $k$ edges, can they? | |
Jun 25, 2019 at 11:22 | answer | added | Gordon Royle | timeline score: 3 | |
Jun 25, 2019 at 9:22 | comment | added | Aidan Rocke | @FedorPetrov Thanks for pointing this out. | |
Jun 25, 2019 at 9:21 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
removed 'planar' term
|
Jun 25, 2019 at 9:20 | comment | added | Fedor Petrov | Hm, this power of 2 counts all graphs, not only planar? | |
Jun 25, 2019 at 9:16 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
added uniqueness criterion
|
Jun 25, 2019 at 7:15 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
simplified disclaimer
|
Jun 25, 2019 at 6:33 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
slight improvement to question
|
Jun 25, 2019 at 5:57 | history | edited | Martin Sleziak |
edited tags
|
|
Jun 25, 2019 at 5:53 | history | asked | Aidan Rocke | CC BY-SA 4.0 |