Drawings of Planar Graphs with Few Slopes and Segments

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on $n$ vertices has a plane drawing with at most ${5/2}n$ segments and at most $2n$ slopes. We prove that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). In a companion paper, drawings of non-planar graphs with few slopes are also considered.
This paper is submitted to a journal. A preliminary version appeared as "Really Straight Graph Drawings" in the Graph Drawing 2004 conference. See http://arxiv.org/math/0606446 for a companion paper

Keywords

Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/168649

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0606450
 http://arxiv.org/abs/math/0606450
 Computational Geometry: Theory and Applications 38:194-212, 2007
 doi:10.1016/j.comgeo.2006.09.002

Collections

arXiv