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. © 2012 Springer-Verlag.
CITATION STYLE
Hong, S. H., Eades, P., Liotta, G., & Poon, S. H. (2012). Fáry’s theorem for 1-planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7434 LNCS, pp. 335–346). https://doi.org/10.1007/978-3-642-32241-9_29
Mendeley helps you to discover research relevant for your work.