Timeline for Ways to look at a polyhedral graph
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27, 2017 at 17:57 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image links broken; now fixed.
|
| Feb 3, 2013 at 14:58 | comment | added | Joseph O'Rourke | @Hans: I believe that Hodgson et al. paper does characterize inscribable graphs in $\mathbb{E}^3$, i.e., in "flat space $\mathbb{R}^3$." | |
| Feb 3, 2013 at 14:39 | comment | added | Hans-Peter Stricker | @Joseph: BTW, the second reference (to Rote) is a late answer to another question of mine: mathoverflow.net/questions/119455/…. Thanks a lot for this one, too! | |
| Feb 3, 2013 at 14:37 | comment | added | Hans-Peter Stricker | @Joseph: Do you know of a comparable result for inscribable polyhedral graphs in flat space $\mathbb{R}^3$? (I am not so familiar with hyperbolic space and have a lack of imagination.) | |
| Feb 2, 2013 at 23:39 | comment | added | Hans-Peter Stricker | For those who don't have a Springer account: page.mi.fu-berlin.de/rote/Papers/slides/… | |
| Feb 2, 2013 at 18:40 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Fixed link. Etc.
|
| Feb 2, 2013 at 18:31 | comment | added | Joseph O'Rourke | @Hans: I have used Tutte's embedding theorem: Every 3-connected planar graph can be straight-line embedded in the plane so that each face is convex and each vertex a wheel. I'll add a reference to my answer. | |
| Feb 2, 2013 at 18:30 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Günter paper added.
|
| Feb 2, 2013 at 17:26 | comment | added | Hans-Peter Stricker | @Joseph Thank you for the representation of polyhedrons by differently colored (shaded) faces and vertices. This helps a lot. Can this be automated (given an abstract polyhedral graph)? | |
| Feb 2, 2013 at 16:37 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |