Timeline for Finding a simple dual of a simple graph in some surface
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23, 2012 at 3:32 | comment | added | a06e | related: cstheory.stackexchange.com/q/11735/5982 | |
| Jun 15, 2012 at 4:30 | comment | added | a06e | Do you know where I can find some more information about polyhedral embeddings? Specifically, it would be nice if I could read an explanation of an algorithm that finds a polyhedral embedding of a graph if there is one. (Perhaps you know how to do it?) | |
| Jun 14, 2012 at 3:55 | comment | added | a06e | I delayed marking this as the answer hoping I could get additional information from other answers. Thanks! | |
| Jun 14, 2012 at 3:54 | vote | accept | a06e | ||
| Jun 10, 2012 at 7:41 | history | answered | David Eppstein | CC BY-SA 3.0 |