Drawing Partially Embedded and Simultaneously Planar Graphs

DOI10.7155/jgaa.00375zbMath1328.05130OpenAlexW2399460596WikidataQ56976942 ScholiaQ56976942MaRDI QIDQ5899628

Anna Lubiw, Carsten Gutwenger, Marcus Schaefer, Fabrizio Frati, Petra Mutzel, Timothy M. Chan

Publication date: 7 January 2016

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00375

zbMATH Keywords

partially embedded graph problemsimultaneous planarity problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (19)

A new algorithm for embedding plane graphs at fixed vertex locations ⋮ The Complexity of Drawing a Graph in a Polygonal Region ⋮ Hanani--Tutte and Hierarchical Partial Planarity ⋮ RAC-drawability is \(\exists \mathbb{R} \)-complete ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ Extending Partial Orthogonal Drawings ⋮ On compatible triangulations with a minimum number of Steiner points ⋮ Small Point-Sets Supporting Graph Stories ⋮ Small point-sets supporting graph stories ⋮ The complexity of drawing a graph in a polygonal region ⋮ Complexity of Geometric k-Planarity for Fixed k ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ How to Draw a Planarization ⋮ Unnamed Item ⋮ Hierarchical partial planarity ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ Simultaneous Embedding ⋮ On the Complexity of Some Geometric Problems With Fixed Parameters ⋮ Extending Partial Orthogonal Drawings

This page was built for publication: Drawing Partially Embedded and Simultaneously Planar Graphs