Graphs that Admit Right Angle Crossing Drawings

DOI10.1007/978-3-642-16926-7_14zbMath1309.68144OpenAlexW1770850069MaRDI QIDQ3057620

Karin Arikushi, Balázs Keszegh, Radoslav Fulek, Filip Morić, Csaba D. Tóth

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_14

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Right Angle Crossing Graphs and 1-Planarity ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Right angle crossing graphs and 1-planarity ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ Area, curve complexity, and crossing resolution of non-planar graph drawings ⋮ Drawing graphs with right angle crossings ⋮ Bounds on the crossing resolution of complete geometric graphs

Cites Work

• Improving the crossing lemma by finding more crossings in sparse graphs
• On the maximum number of edges in quasi-planar graphs
• On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles
• Drawing Graphs with Right Angle Crossings
• Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
• Crossing-Free Subgraphs
• Notes on large angle crossing graphs
• On the Perspectives Opened by Right Angle Crossing Drawings

This page was built for publication: Graphs that Admit Right Angle Crossing Drawings