Bounds on the crossing resolution of complete geometric graphs
DOI10.1016/J.DAM.2011.09.016zbMATH Open1237.05050DBLPjournals/dam/GiacomoDEHL12OpenAlexW2037942952WikidataQ62042447 ScholiaQ62042447MaRDI QIDQ765347FDOQ765347
Authors: Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta 
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.016
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Drawing Graphs with Right Angle Crossings
- On the perspectives opened by right angle crossing drawings
- A characterization of complete bipartite RAC graphs
- Bounded-degree graphs have arbitrarily large geometric thickness
- Bounded-degree graphs can have arbitrarily large slope numbers
- Geometric representation of cubic graphs with four directions
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Graphs that admit right angle crossing drawings
- Geometric Thickness of Complete Graphs
- Drawing cubic graphs with at most five slopes
Cited In (6)
- On crossing families of complete geometric graphs
- A greedy heuristic for crossing-angle maximization
- Angular Resolutions: Around Vertices and Crossings
- Vertex angle and crossing angle resolution of leveled tree drawings
- Reporting the crossing-free segments of a complete geometric graph
- Right angle crossing graphs and 1-planarity
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)
