A characterization of complete bipartite RAC graphs
From MaRDI portal
Publication:765516
DOI10.1016/j.ipl.2010.05.023zbMath1234.68324OpenAlexW2046203894WikidataQ59702321 ScholiaQ59702321MaRDI QIDQ765516
Peter Eades, Giuseppe Liotta, Walter Didimo
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.023
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (18)
Circular right-angle crossing drawings in linear time ⋮ EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING ⋮ Right Angle Crossing Graphs and 1-Planarity ⋮ Combinatorial properties and recognition of unit square visibility graphs ⋮ Right angle crossing graphs and 1-planarity ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ Area, curve complexity, and crossing resolution of non-planar graph drawings ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ 2-layer right angle crossing drawings ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Drawing graphs with right angle crossings ⋮ Unnamed Item ⋮ On RAC drawings of graphs with one bend per edge ⋮ On RAC drawings of graphs with one bend per edge ⋮ The Straight-Line RAC Drawing Problem Is NP-Hard ⋮ Bounds on the crossing resolution of complete geometric graphs ⋮ Right Angle Crossing Drawings of Graphs
Cites Work
This page was built for publication: A characterization of complete bipartite RAC graphs
