TY  - GEN
ID  - gdea_3787
UR  - http://gdea.informatik.uni-koeln.de/787/
A1  - Massow, Mareike
A1  - Felsner, Stefan
Y1  - 2007///
N2  - 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.
    
PB  - Springer
T3  - Lecture notes in Computer Science
TI  - Thickness of Bar 1-Visibility Graphs
SP  - 330
AV  - none
EP  - 342
ER  -