On RAC drawings of graphs with one bend per edge
From MaRDI portal
Publication:5918835
DOI10.1016/j.tcs.2020.04.018zbMath1443.68117arXiv1808.10470OpenAlexW2889026374MaRDI QIDQ5918835
No author found.
Publication date: 26 May 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.10470
Related Items
Cites Work
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- Graphs that admit right angle crossing drawings
- 2-layer right angle crossing drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing graphs with right angle crossings
- A characterization of complete bipartite RAC graphs
- Improving the crossing lemma by finding more crossings in sparse graphs
- On the maximum number of edges in quasi-planar graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- A linear-time algorithm for testing full outer-2-planarity
- Gap-planar graphs
- Empirical evaluation of aesthetics-based graph layout
- Right angle crossing graphs and 1-planarity
- On topological graphs with at most four crossings per edge
- Ein Sechsfarbenproblem auf der Kugel
- On RAC drawings of 1-planar graphs
- An annotated bibliography on 1-planarity
- \(\mathsf{NIC}\)-planar graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- On the Density of Non-simple 3-Planar Graphs
- The Straight-Line RAC Drawing Problem is NP-Hard
- On Optimal 2- and 3-Planar Graphs
- On the size of planarly connected crossing graphs
- The Number of Edges in $k$-Quasi-planar Graphs
- On the Perspectives Opened by Right Angle Crossing Drawings
- Compact drawings of 1-planar graphs with right-angle crossings and few bends
This page was built for publication: On RAC drawings of graphs with one bend per edge
