Right Angle Crossing Graphs and 1-Planarity

DOI10.1007/978-3-642-25878-7_15zbMath1311.68115OpenAlexW1879570458WikidataQ62042468 ScholiaQ62042468MaRDI QIDQ3223950

Peter Eades, Giuseppe Liotta

Publication date: 9 March 2012

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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)

Related Items (6)

Circular right-angle crossing drawings in linear time ⋮ Area requirement of graph drawings with few crossings per edge ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ 2-layer right angle crossing drawings ⋮ Drawing graphs with right angle crossings

Cites Work

• A characterization of complete bipartite RAC graphs
• The structure of 1-planar graphs
• Optimal 1-planar graphs which triangulate other surfaces
• Graphs drawn with few crossings per edge
• Graphs that Admit Right Angle Crossing Drawings
• On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles
• The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
• The Straight-Line RAC Drawing Problem Is NP-Hard
• Drawing Graphs with Right Angle Crossings
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Acyclic colouring of 1-planar graphs

This page was built for publication: Right Angle Crossing Graphs and 1-Planarity