Fundamentals of planar ordered sets
Discrete Mathematics
Algorithms for plane representations of acyclic digraphs
Theoretical Computer Science
Light sources, obstructions and spherical orders
Discrete Mathematics
Discrete Mathematics
On the Computational Complexity of Upward and Rectilinear Planarity Testing
SIAM Journal on Computing
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information
IEEE Transactions on Visualization and Computer Graphics
Upper Bounds for Monotone Planar Circuit Value and Variants
Computational Complexity
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Classification of planar upward embedding
GD'11 Proceedings of the 19th international conference on Graph Drawing
The duals of upward planar graphs on cylinders
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
The duals of upward planar graphs on cylinders
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Upward planar drawings on the standing and the rolling cylinders
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinders. These classes extend the upward planar graphs in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.