Bounds on the crossing resolution of complete geometric graphs
From MaRDI portal
(Redirected from Publication:765347)
Recommendations
Cites work
- A characterization of complete bipartite RAC graphs
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Bounded-degree graphs can have arbitrarily large slope numbers
- Bounded-degree graphs have arbitrarily large geometric thickness
- Drawing Graphs with Right Angle Crossings
- Drawing cubic graphs with at most five slopes
- Geometric Thickness of Complete Graphs
- Geometric representation of cubic graphs with four directions
- Graphs that admit right angle crossing drawings
- On the perspectives opened by right angle crossing drawings
Cited in
(9)- Angular Resolutions: Around Vertices and Crossings
- Right angle crossing graphs and 1-planarity
- Reporting the crossing-free segments of a complete geometric graph
- The crossing-angle resolution in graph drawing
- A greedy heuristic for crossing-angle maximization
- Crossing angles of geometric graphs
- On crossing families of complete geometric graphs
- Crossing angles of geometric graphs
- Vertex angle and crossing angle resolution of leveled tree drawings
This page was built for publication: Bounds on the crossing resolution of complete geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765347)