Encompassing colored planar straight line graphs
✍ Scribed by Ferran Hurtado; Mikio Kano; David Rappaport; Csaba D. Tóth
- Book ID
- 108100972
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 222 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0925-7721
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the
## Abstract We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008