TY  - GEN
ID  - gdea_3596
UR  - http://gdea.informatik.uni-koeln.de/596/
A1  - Healy, Patrick
A1  - Lynch, Karol
Y1  - 2004///
N2  - We show that a digraph is upward planar if and only if its biconnected components have certain properties.

PB  - Springer
TI  - Building Blocks of Upward Planar Digraphs
SP  - 296
AV  - none
EP  - 306
ER  -