Drawing cubic graphs with at most five slopes

Authors:
B. Keszegh;J. Pach;D. Pálvölgyi;G. Tóth
Affiliations:
Central European University, Budapest;Courant Institute, NYU, New York and A. Rényi Institute of Mathematics, Budapest;Eötvös University, Budapest;A. Rényi Institute of Mathematics, Budapest
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 2
Cited 4

The geometric thickness of low degree graphs

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Really straight graph drawings

GD'04 Proceedings of the 12th international conference on Graph Drawing

Drawing cubic graphs with at most five slopes

Computational Geometry: Theory and Applications
Cubic Graphs Have Bounded Slope Parameter

Graph Drawing
Geometric representation of cubic graphs with four directions

Computational Geometry: Theory and Applications
The planar slope number of planar partial 3-trees of bounded degree

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice.