Cubic Graphs Have Bounded Slope Parameter
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 only at most seven different edge slopes.
KeywordsMaximum Degree Complete Graph Slope Parameter Basic Slope Regular Pentagon
- 2.Barát, J., Matoušek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electr. J. Combin. 13(1), R3, 14pp. (2006)Google Scholar
- 6.Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: SoCG 2004, pp. 340–346. ACM Press, New York (2004)Google Scholar
- 13.Mukkamala, P., Szegedy, M.: Geometric representation of cubic graphs with four directions (manuscript, 2007)Google Scholar
- 15.Pach, J., Pálvölgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electr. J. Combin. 13(1), Note 1, 4pp. (2006)Google Scholar