Testing Simultaneous Planarity When the Common Graph Is 2-Connected

DOI10.1007/978-3-642-17514-5_35zbMath1310.68163arXiv1009.4517OpenAlexW1857247017MaRDI QIDQ3060792

Bernhard Haeupler, K. R. Jampani, Anna Lubiw

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.4517

zbMATH Keywords

planar graphgraph drawingsimultaneous embeddingPQ tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph ⋮ Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid ⋮ Disconnectivity and relative positions in simultaneous embeddings

This page was built for publication: Testing Simultaneous Planarity When the Common Graph Is 2-Connected