Rolling upward planarity testing of strongly connected graphs

DOI10.1007/978-3-642-45043-3_5zbMATH Open1417.05197OpenAlexW1563160972MaRDI QIDQ2864288FDOQ2864288

Authors: Christopher Auer, Christian Bachmaier, Kathrin Hanauer, Franz J. Brandenburg 

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_5

Recommendations

• Upward planar drawings on the standing and the rolling cylinders
• scientific article; zbMATH DE number 431511
• Upward planar graphs and their duals
• The Duals of Upward Planar Graphs on Cylinders
• Classification of planar upward embedding

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Cited In (5)

• The complexity of upward drawings on spheres
• Classification of planar upward embedding
• Upward planar graphs and their duals
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Upward planar drawings on the standing and the rolling cylinders

This page was built for publication: Rolling upward planarity testing of strongly connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864288)