Planar drawing is preserved under edge removal
ProvedWilliamsonShmoys.hasPlanarDrawingOn_mono__p2m_168460db_bad2_471e_a83e_74dae3ce8af4_a1approximation-algorithmsplanar-graphstreewidth
If one graph is a subgraph of another graph with a planar drawing, the subgraph has a planar drawing using the same vertex positions and edge arcs.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.hasPlanarDrawingOn_mono__p2m_168460db_bad2_471e_a83e_74dae3ce8af4_a1
{V : Type} [Fintype V] [LinearOrder V]
{G H : SimpleGraph V}
(hGH : G ≤ H) :
HasPlanarDrawingOn H → HasPlanarDrawingOn G := by sorrySource
David P. Williamson and David B. Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011, author electronic manuscript, Section 10.2, proof of Theorem 10.11, pp. 270-272. https://doi.org/10.1017/CBO9780511921735. Bounded tree-width of the pieces: Robertson–Seymour (planar graphs of radius r have tree-width at most 3r+1) / Bodlaender (k-outerplanar graphs have tree-width at most 3k-1).