A Kuratowski-type theorem for planarity of partially embedded graphs
From MaRDI portal
Publication:1940706
DOI10.1016/j.comgeo.2012.07.005zbMath1259.05044MaRDI QIDQ1940706
Ignaz Rutter, Vít Jelínek, Jan Kratochvíl
Publication date: 7 March 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.07.005
Related Items
Beyond Clustered Planar Graphs, Extending Partial Orthogonal Drawings, The Complexity of Drawing a Graph in a Polygonal Region, Extending Partial Orthogonal Drawings, Complexity of Geometric k-Planarity for Fixed k, Extending upward planar graph drawings, Hierarchical partial planarity, Multilevel Planarity, Drawing Simultaneously Embedded Graphs with Few Bends, Extending partial representations of circular-arc graphs, Extending convex partial drawings of graphs, Strip planarity testing for embedded planar graphs, Minimal obstructions for partial representations of interval graphs, One-bend drawings of outerplanar graphs inside simple polygons, Extending simple drawings, An SPQR-tree-like embedding representation for upward planarity, Free edge lengths in plane graphs, Minimal Obstructions for Partial Representations of Interval Graphs