Cubic graphs have bounded slope parameter
DOI:
https://doi.org/10.7155/jgaa.00196Abstract
We show that every finite connected graph G with maximum degree three and with at least one vertex of degree smaller than three has a straight-line drawing in the plane satisfying the following conditions. No three vertices are collinear, and a pair of vertices form an edge in G if and only if the segment connecting them is parallel to one of the sides of a previously fixed regular pentagon. It is also proved that every finite graph with maximum degree three permits a straight-line drawing with the above properties using at most seven different edge slopes.Downloads
Download data is not yet available.
Downloads
Published
2010-01-01
How to Cite
Keszegh, B., Pach, J., Pálvölgyi, D., & Tóth, G. (2010). Cubic graphs have bounded slope parameter. Journal of Graph Algorithms and Applications, 14(1), 5–17. https://doi.org/10.7155/jgaa.00196
Issue
Section
Articles
Categories
License
Copyright (c) 2010 Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
This work is licensed under a Creative Commons Attribution 4.0 International License.