Every outer-1-plane graph has a right angle crossing drawing

DOI10.1142/S021819591250015XMaRDI QIDQ5300010zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hooman Reisi Dehkordi, Peter Eades

Publication date 24 June 2013

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021819591250015x

zbMATH Keywords

1-planar graphgraph drawingouter-1-planar graphouterplanar graphRAC drawingright angle crossing graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Drawing graphs with right angle crossings
• Drawing Graphs with Right Angle Crossings
• Graphs that admit right angle crossing drawings
• On the perspectives opened by right angle crossing drawings
• Graphs that admit right angle crossing drawings

Cites work

• A characterization of complete bipartite RAC graphs
• Area, curve complexity, and crossing resolution of non-planar graph drawings
• Characterizations of outerplanar graphs
• Drawing graphs with right angle crossings
• Empirical evaluation of aesthetics-based graph layout
• Graphs drawn with few crossings per edge
• On the perspectives opened by right angle crossing drawings
• Re-embeddings of Maximum 1-Planar Graphs

Cited in

(16)

• Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
• Right angle crossing graphs and 1-planarity
• Linear arboricity of outer-1-planar graphs
• One-bend drawings of outerplanar graphs inside simple polygons
• Optimal-area visibility representations of outer-1-plane graphs
• Fan-planarity: properties and complexity
• An annotated bibliography on 1-planarity
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• Outer 1-planar graphs
• Circular right-angle crossing drawings in linear time
• A linear-time algorithm for testing outer-1-planarity
• Right Angle Crossing Drawings of Graphs
• The structure and the list 3-dynamic coloring of outer-1-planar graphs
• Drawing outer-1-planar graphs revisited
• Efficient computation of crossing components and shortcut hulls
• The edge chromatic number of outer-1-planar graphs

This page was built for publication: Every outer-1-plane graph has a right angle crossing drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300010)