On visibility representations of non-planar graphs
From MaRDI portal
Publication:3132853
DOI10.4230/LIPICS.SOCG.2016.19zbMATH Open1387.68241MaRDI QIDQ3132853FDOQ3132853
Authors: Giuseppe Liotta, Fabrizio Montecchiani, Therese Biedl 
Publication date: 30 January 2018
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (23)
- Recognizing Visibility Graphs of Triangulated Irregular Networks
- Visibility representations of boxes in 2.5 dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ortho-polygon visibility representations of embedded graphs
- Edge Partitions and Visibility Representations of 1-planar Graphs
- Title not available (Why is that?)
- 3D Visibility Representations of 1-planar Graphs
- Combinatorial properties and recognition of unit square visibility graphs
- Area, perimeter, height, and width of rectangle visibility graphs
- Improved visibility representation of plane graphs
- Rectangle-visibility representations of bipartite graphs
- On 3D visibility representations of graphs with few crossings per edge
- Ortho-polygon visibility representations of 3-connected 1-plane graphs
- Rectangular and visibility representations of infinite planar graphs
- Constrained visibility representations of graphs
- On RAC drawings of 1-planar graphs
- An annotated bibliography on 1-planarity
- On partitioning the edges of 1-plane graphs
- New results on edge partitions of 1-plane graphs
- Characterizing and recognizing 4-map graphs
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Colored anchored visibility representations in 2D and 3D space
This page was built for publication: On visibility representations of non-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132853)
