Timeline for Always a planar-drawn cycle through $n$ points
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 21, 2015 at 12:27 | history | edited | Marco Golla | CC BY-SA 3.0 |
deleted rubbish sentence, improved formatting and spelling.
|
| S Dec 21, 2015 at 12:27 | history | suggested | JMP | CC BY-SA 3.0 |
deleted rubbish sentence
|
| Dec 21, 2015 at 12:25 | review | Suggested edits | |||
| S Dec 21, 2015 at 12:27 | |||||
| Dec 19, 2015 at 16:48 | comment | added | Joseph O'Rourke | For completeness, this approach requires a proof that there always exists a pair of edges on nested cycles that can be removed and replaced to connect the two cycles to one. | |
| Dec 19, 2015 at 16:17 | comment | added | Joseph O'Rourke | (I incorporated your figure.) | |
| Dec 19, 2015 at 16:17 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
deleted 18 characters in body
|
| Dec 19, 2015 at 15:30 | review | First posts | |||
| Dec 19, 2015 at 15:47 | |||||
| Dec 19, 2015 at 15:29 | history | answered | srmusawi | CC BY-SA 3.0 |