Density of straight-line 1-planar graph drawings

DOI10.1016/j.ipl.2013.01.013zbMath1259.05107OpenAlexW2091733471MaRDI QIDQ1943644

Walter Didimo

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.01.013

zbMATH Keywords

combinatorial problemscomputational geometryedge density1-planar graphscircular drawingslayered drawingsstraight-line graph drawings

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Density (toughness, etc.) (05C42)

Related Items (23)

The density of fan-planar graphs ⋮ Outer 1-planar graphs ⋮ Recognizing and drawing IC-planar graphs ⋮ On fan-crossing and fan-crossing free graphs ⋮ Area requirement of graph drawings with few crossings per edge ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ On RAC drawings of 1-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ On morphing 1-planar drawings ⋮ Straight-line drawings of 1-planar graphs ⋮ A note on 1-planar graphs ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ On partitioning the edges of 1-plane graphs ⋮ Remarks on the joins of 1-planar graphs ⋮ The maximal 1-planarity and crossing numbers of graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ Right Angle Crossing Drawings of Graphs ⋮ 2-Layer k-Planar Graphs ⋮ Fan-planarity: properties and complexity ⋮ On the Number of Edges of Fan-Crossing Free Graphs

This page was built for publication: Density of straight-line 1-planar graph drawings