Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs

DOI10.1007/978-3-319-03841-4_8zbMath1406.68054OpenAlexW165147621MaRDI QIDQ2867646

Stephen G. Kobourov, Md. Jawaherul Alam, Franz-Josef Brandenburg

Publication date: 20 December 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

The density of fan-planar graphs, Outer 1-planar graphs, Recognizing and drawing IC-planar graphs, A survey on book-embedding of planar graphs, Recognizing IC-Planar and NIC-Planar Graphs, On RAC drawings of 1-planar graphs, The Stub Resolution of 1-planar Graphs, On polyhedral graphs and their complements, Fan-crossing free graphs and their relationship to other beyond-planar graphs, An annotated bibliography on 1-planarity, The book thickness of 1-planar graphs is constant, \(\mathsf{NIC}\)-planar graphs, 1-page and 2-page drawings with bounded number of crossings per edge, Straight-line drawings of 1-planar graphs, Book embeddings of \(k\)-framed graphs and \(k\)-map graphs, The family of fan-planar graphs, An annotated review on graph drawing and its applications, \(\mathsf{T}\)-shape visibility representations of 1-planar graphs, Colored anchored visibility representations in 2D and 3D space, Unnamed Item, Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles, Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity, Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, Two Results on Layered Pathwidth and Linear Layouts, Re-embedding a 1-plane graph for a straight-line drawing in linear time, Characterizing and recognizing 4-map graphs, On partitioning the edges of 1-plane graphs, Embedding-preserving rectangle visibility representations of nonplanar graphs, Characterizing 5-map graphs by 2-fan-crossing graphs, Unnamed Item, Ortho-polygon visibility representations of embedded graphs, 1-planarity testing and embedding: an experimental study, Fan-planarity: properties and complexity