Rolling Upward Planarity Testing of Strongly Connected Graphs

DOI10.1007/978-3-642-45043-3_5zbMath1417.05197OpenAlexW1563160972MaRDI QIDQ2864288

Christian Bachmaier, Christopher Auer, Kathrin Hanauer, Franz-Josef 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

Mathematics Subject Classification ID

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

Related Items (1)

Upward planar graphs and their duals

This page was built for publication: Rolling Upward Planarity Testing of Strongly Connected Graphs