A Kuratowski-type theorem for planarity of partially embedded graphs

DOI10.1016/j.comgeo.2012.07.005zbMath1259.05044OpenAlexW2217795179MaRDI 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

zbMATH Keywords

planar graphsKuratowski theorempartially embedded graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Related Items (19)

The Complexity of Drawing a Graph in a Polygonal Region ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ Extending convex partial drawings of graphs ⋮ Extending Partial Orthogonal Drawings ⋮ Minimal Obstructions for Partial Representations of Interval Graphs ⋮ Extending partial representations of circular-arc graphs ⋮ Partial and simultaneous transitive orientations via modular decompositions ⋮ Extending simple drawings ⋮ An SPQR-tree-like embedding representation for upward planarity ⋮ Complexity of Geometric k-Planarity for Fixed k ⋮ Minimal obstructions for partial representations of interval graphs ⋮ Extending upward planar graph drawings ⋮ Strip planarity testing for embedded planar graphs ⋮ Hierarchical partial planarity ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ Multilevel Planarity ⋮ Beyond Clustered Planar Graphs ⋮ Extending Partial Orthogonal Drawings ⋮ Free edge lengths in plane graphs

This page was built for publication: A Kuratowski-type theorem for planarity of partially embedded graphs