Drawing cubic graphs with at most five slopes

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.


Publié dans:
Computational Geometry - Theory and Applications, 40, 2, 138-147
Année
2008
Mots-clefs:
Note:
Professor Pach's number: [206]. Also in: Graph Drawing 2006, Lecture Notes in Computer Science 4372, Springer, 2007, 114-125.
Laboratoires:




 Notice créée le 2008-11-14, modifiée le 2019-03-16

n/a:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)