## 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)
Full text not available from this repository. ## AbstractWe 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.
Repository Staff Only: item control page References |