Convex geometric (k+2)-quasiplanar representations of semi-bar k-visibility graphs
From MaRDI portal
(Redirected from Publication:397151)
Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs
Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs
Abstract: We examine semi-bar visibility graphs in the plane and on a cylinder in which sightlines can pass through k objects. We show every semi-bar k-visibility graph has a (k+2)-quasiplanar representation in the plane with vertices drawn as points in convex position and edges drawn as segments. We also show that the graphs having cylindrical semi-bar k-visibility representations with semi-bars of different lengths are the same as the (2k+2)-degenerate graphs having edge-maximal (k+2)-quasiplanar representations in the plane with vertices drawn as points in convex position and edges drawn as segments.
Recommendations
Cites work
- scientific article; zbMATH DE number 1744102 (Why is no real title available?)
- A Turán-type theorem on chords of a convex polygon
- A note on visibility graphs
- Bar k-Visibility Graphs
- Further Results on Bar k-Visibility Graphs
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
- On \(k\)-visibility graphs
- Parameters of Bar k-Visibility Graphs
- Representing a planar graph by vertical lines joining different levels
This page was built for publication: Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397151)