Timeline for Convex caps with prescribed edges
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2017 at 16:23 | comment | added | Joseph Malkevitch | Graphs of the kind that I describe are sometimes called Halin graphs, and they have many nice properties: See, Bondy, J.A. and Lovász, L., 1985. Lengths of cycles in Halin graphs. Journal of graph theory, 9(3), pp.397-410. The extension of Steinitz Theorem I refer to can be found in the paper here: msp.org/pjm/1970/32-2/pjm-v32-n2-p02-s.pdf | |
| Sep 22, 2017 at 0:18 | comment | added | Mohammad Ghomi | This sounds like it would be more restrictive than the situation I am asking about, as it corresponds to the case where each face of the subdivision has an edge on the boundary of the polygon P. But it still would be nice to know how things would work out in this case. So you say that this follows from the Proof of Steinitz theorem? | |
| Sep 21, 2017 at 18:41 | history | answered | Joseph Malkevitch | CC BY-SA 3.0 |