On RAC drawings of graphs with two bends per edge
From MaRDI portal
Publication:6616241
DOI10.7155/JGAA.V28I2.2939zbMATH Open1548.05246MaRDI QIDQ6616241
Publication date: 8 October 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Graphs that admit right angle crossing drawings
- Drawing graphs with right angle crossings
- RAC drawings in subcubic area
- Gap-planar graphs
- RAC-drawability is \(\exists \mathbb{R} \)-complete
- Graphs That Admit Polyline Drawings with Few Crossing Angles
- The Straight-Line RAC Drawing Problem is NP-Hard
- Right Angle Crossing Drawings of Graphs
- Notes on large angle crossing graphs
- On RAC drawings of graphs with one bend per edge
- On RAC drawings of graphs with two bends per edge
- RAC drawings of graphs with low degree
- Axis-parallel right angle crossing graphs
This page was built for publication: On RAC drawings of graphs with two bends per edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616241)
