Combinatorial properties and recognition of unit square visibility graphs
From MaRDI portal
Publication:5111244
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1962799 (Why is no real title available?)
- A Note on Rectilinearity and Angular Resolution
- A Visibility Representation for Graphs in Three Dimensions
- A unified approach to visibility representations of planar graphs
- Bar k-Visibility Graphs
- Combinatorial properties and recognition of unit square visibility graphs
- Complexity of finding non-planar rectilinear drawings of graphs
- Drawing Graphs in the Plane with High Resolution
- Drawing graphs with right angle crossings
- Maximizing the total resolution of graphs
- Obstructing visibilities with one obstacle
- On Rectilinear Drawing of Graphs
- On \(k\)-visibility graphs
- On visibility representations of non-planar graphs
- Rectangle and Square Representations of Planar Graphs
- Rectangle-visibility representations of bipartite graphs
- Representing a planar graph by vertical lines joining different levels
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- The complexity of minimizing wire lengths in VLSI layouts
- The complexity of satisfiability problems
- The straight-line RAC drawing problem is NP-hard
- The unit bar visibility number of a graph
- Unit rectangle visibility graphs
Cited in
(5)
This page was built for publication: Combinatorial properties and recognition of unit square visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111244)
