Fáry’s Theorem for 1-Planar Graphs

DOI10.1007/978-3-642-32241-9_29zbMath1364.68308OpenAlexW2275362914WikidataQ62041793 ScholiaQ62041793MaRDI QIDQ2914338

Sheung-Hung Poon, Seok-Hee Hong, Peter Eades, Giuseppe Liotta

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_29

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (38)

The density of fan-planar graphs ⋮ Outer 1-planar graphs ⋮ Recognizing and drawing IC-planar graphs ⋮ Straight-Line Drawability of a Planar Graph Plus an Edge ⋮ Recognizing and embedding simple optimal 2-planar graphs ⋮ Area requirement of graph drawings with few crossings per edge ⋮ On RAC drawings of 1-planar graphs ⋮ The Stub Resolution of 1-planar Graphs ⋮ Drawing outer-1-planar graphs revisited ⋮ An annotated bibliography on 1-planarity ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ Straight-line drawings of 1-planar graphs ⋮ A note on 1-planar graphs ⋮ An annotated review on graph drawing and its applications ⋮ Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ A new note on 1-planar graphs with minimum degree 7 ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ Right angle crossing graphs and 1-planarity ⋮ How to Draw a Planarization ⋮ Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ Joins of 1-planar graphs ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ On partitioning the edges of 1-plane graphs ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Testing Full Outer-2-planarity in Linear Time ⋮ Beyond Planar Graphs: Introduction ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Algorithms for 1-Planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ 1-planarity testing and embedding: an experimental study ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Fan-planarity: properties and complexity ⋮ On the Number of Edges of Fan-Crossing Free Graphs

This page was built for publication: Fáry’s Theorem for 1-Planar Graphs