## Really straight drawings II: Non-planar graphs (2005)

by
Vida Dujmović
,
Matthew Suderman
,
David R. Wood

Citations: | 1 - 1 self |

### BibTeX

@MISC{Dujmović05reallystraight,

author = {Vida Dujmović and Matthew Suderman and David R. Wood},

title = {Really straight drawings II: Non-planar graphs},

year = {2005}

}

### OpenURL

### Abstract

We study straight-line drawings of non-planar graphs with few slopes. Interval graphs, co-comparability graphs and AT-free graphs are shown to have have drawings in which the number of slopes is bounded by the maximum degree. We prove that graphs of bounded degree and bounded treewidth have drawings with O(log n) slopes. Finally we prove that every graph has a drawing with one bend per edge, in which the number of slopes is at most one more than the maximum degree. In a companion paper, planar drawings of graphs with few slopes are also considered.