Timeline for Find all faces in a graph from list of edges
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 27, 2021 at 18:12 | comment | added | Stef | "If the neighbors of each vertex are listed in counterclockwise order, this defines an embedding on a surface, and if this information was obtained from a given planar embedding, this is the one you get back. " Could you provide a reference to support that claim? | |
| Oct 30, 2014 at 11:50 | comment | added | Brendan McKay | Actually you need 3-vertex-connected in general. If there is a cut of one or two vertices you can turn over the graph on one side if it. | |
| Oct 29, 2014 at 15:47 | history | edited | Klaus Draeger | CC BY-SA 3.0 |
deleted 7 characters in body
|
| Oct 29, 2014 at 13:41 | history | answered | Klaus Draeger | CC BY-SA 3.0 |