Parameters of Bar k-Visibility Graphs
From MaRDI portal
Publication:5301426
Recommendations
Cited in
(16)- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
- Convex geometric (k+2)-quasiplanar representations of semi-bar k-visibility graphs
- Bar k-Visibility Graphs
- Simultaneous visibility representations of undirected pairs of graphs
- Graph Drawing
- On \(k\)-visibility graphs
- Characterization of \([1,k]\)-bar visibility trees
- Coloring non-crossing strings
- Bar 1-visibility graphs and their relation to other nearly planar graphs
- Further Results on Bar k-Visibility Graphs
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Coverage with \(k\)-transmitters in the presence of obstacles
- Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
- Thickness of Bar 1-Visibility Graphs
- On Aligned Bar 1-Visibility Graphs
- Colored anchored visibility representations in 2D and 3D space
This page was built for publication: Parameters of Bar k-Visibility Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301426)