Drawing cubic graphs with at most five slopes

Keszegh, Balázs and Pach, János and Pálvölgyi, Dömötör and Tóth, Géza (2007) Drawing cubic graphs with at most five slopes. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 114-125(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_13).

Full text not available from this repository.


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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-70904-6_13
Classifications: P Styles > P.720 Straight-line
URI: http://gdea.informatik.uni-koeln.de/id/eprint/767

Actions (login required)

View Item View Item