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 every connected component of G has at least one vertex of degree less than three, then four directions suffice
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.