%S Lecture notes in Computer Science
%A Mareike Massow
%A Stefan Felsner
%T Thickness of Bar 1-Visibility Graphs
%X Bar k-visibility graphs are graphs admitting a representation in
which the vertices correspond to horizontal line segments, called
bars, and the edges correspond to vertical lines of sight which can
traverse up to k bars. These graphs were introduced by Dean et
al. [3] who conjectured that bar 1-visibility graphs have
thickness at most 2. We construct a bar 1-visibility graph having
thickness 3, disproving their conjecture. For a special case of bar
1-visibility graphs we present an algorithm partitioning the edges
into two plane graphs, showing that for this class the thickness is
indeed bounded by 2.
    
%P 330-342
%E Michael Kaufmann
%E Dorothea Wagner
%D 2007
%I Springer
%L gdea_3787