Prefer a chat interface with context about you and your work?
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
A graph is called a strong ( resp.weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp.a subset of) the pairs of vertices whose bars have a -thick vertical line connecting them that intersects at most …