Further Results on Bar k-Visibility Graphs
From MaRDI portal
Publication:3503232
DOI10.1137/050644240zbMATH Open1141.05062OpenAlexW2154709137MaRDI QIDQ3503232FDOQ3503232
Authors: Stephen G. Hartke, Jennifer Vandenbussche, Paul S. Wenger
Publication date: 22 May 2008
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050644240
Recommendations
Cited In (15)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
- Bar k-Visibility Graphs
- Parameters of Bar k-Visibility Graphs
- Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs
- Simultaneous visibility representations of undirected pairs of graphs
- Graph Drawing
- Edge Partitions and Visibility Representations of 1-planar Graphs
- On \(k\)-visibility graphs
- Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs
- Minimal embedding dimensions of rectangle \(k\)-visibility graphs
- On bar \((1, j)\)-visibility graphs (extended abstract)
- Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
- Coverage with \(k\)-transmitters in the presence of obstacles
- On Aligned Bar 1-Visibility Graphs
- On the bar visibility number of complete bipartite graphs
This page was built for publication: Further Results on Bar k-Visibility Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503232)