Planar drawing inherited by subgraphs
ProvedWilliamsonShmoys.planar_drawing_subgraph__p2m_a41ba058_0926_4932_8131_302826679a62_a1approximation-algorithmsplanar-graphstreewidth
If H has a crossing-free drawing on the given ordered vertex type and G is a subgraph of H, then G has such a drawing. Reuse H's vertex placement and edge arcs; the drawing conditions for G are restrictions of those already satisfied by H.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_subgraph__p2m_a41ba058_0926_4932_8131_302826679a62_a1
{V : Type} [Fintype V] [LinearOrder V]
(G H : SimpleGraph V)
(hGH : G ≤ H)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
WilliamsonShmoys.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).