EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
From MaRDI portal
Publication:5300010
DOI10.1142/S021819591250015XzbMath1267.68165OpenAlexW1976024742WikidataQ59702331 ScholiaQ59702331MaRDI QIDQ5300010
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
graph drawingouterplanar graph1-planar graphouter-1-planar graphRAC drawingright angle crossing graph
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Outer 1-planar graphs ⋮ Circular right-angle crossing drawings in linear time ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ On RAC drawings of 1-planar graphs ⋮ Drawing outer-1-planar graphs revisited ⋮ An annotated bibliography on 1-planarity ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ The edge chromatic number of outer-1-planar graphs ⋮ Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Linear arboricity of outer-1-planar graphs ⋮ Right Angle Crossing Drawings of Graphs ⋮ Fan-planarity: properties and complexity ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs
Cites Work
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing graphs with right angle crossings
- A characterization of complete bipartite RAC graphs
- Characterizations of outerplanar graphs
- Graphs drawn with few crossings per edge
- Empirical evaluation of aesthetics-based graph layout
- Re-embeddings of Maximum 1-Planar Graphs
- On the Perspectives Opened by Right Angle Crossing Drawings
This page was built for publication: EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
