Fáry’s Theorem for 1-Planar Graphs
A plane graph is a graph embedded in a plane without edge crossings. Fáry’s theorem states that every plane graph can be drawn as a straight-line drawing, preserving the embedding of the plane graph. In this paper, we extend Fáry’s theorem to a class of non-planar graphs. More specifically, we study the problem of drawing 1-plane graphs with straight-line edges. A 1-plane graph is a graph embedded in a plane with at most one crossing per edge. We give a characterisation of those 1-plane graphs that admit a straight-line drawing. The proof of the characterisation consists of a linear time testing algorithm and a drawing algorithm. Further, we show that there are 1-plane graphs for which every straight-line drawing has exponential area. To the best of our knowledge, this is the first result to extend Fáry’s theorem to non-planar graphs.
Unable to display preview. Download preview PDF.
- 2.Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear time algorithms for convex drawings of planar graphs. In: Progress in Graph Theory, pp. 153–173. Academic Press (1984)Google Scholar
- 6.Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)Google Scholar
- 13.Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific (2004)Google Scholar