Testing Simultaneous Planarity when the Common Graph is 2-Connected
From MaRDI portal
Publication:4913760
DOI10.7155/jgaa.00289zbMath1261.05015OpenAlexW2045884213MaRDI QIDQ4913760
K. R. Jampani, Anna Lubiw, Bernhard Haeupler
Publication date: 9 April 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00289
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Partial and simultaneous transitive orientations via modular decompositions ⋮ An annotated review on graph drawing and its applications ⋮ Beyond Level Planarity ⋮ Simultaneous Orthogonal Planarity ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ The QuaSEFE problem ⋮ Simultaneous embedding: edge orderings, relative positions, cutvertices ⋮ Beyond level planarity: cyclic, torus, and simultaneous level planarity ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ Simultaneous Embedding ⋮ Advancements on SEFE and partitioned book embedding problems
