Restricting a planar drawing to a connected component
ProvedWilliamsonShmoys.hasPlanarDrawingOn_connectedComponent__p2m_e46e8dd0_1680_4d93_a7d5_10e0bd7d8348_a4approximation-algorithmsplanar-graphstreewidth
Restricting the vertex placement and edge arcs to a connected component preserves the drawing conditions. The explicit finite instance covers the component’s subtype of vertices.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.hasPlanarDrawingOn_connectedComponent__p2m_e46e8dd0_1680_4d93_a7d5_10e0bd7d8348_a4 {V : Type} [Fintype V] [LinearOrder V] (G : SimpleGraph V) (hG : WilliamsonShmoys.HasPlanarDrawingOn G) (C : G.ConnectedComponent) [Fintype {v : V // v ∈ C.supp}] : WilliamsonShmoys.HasPlanarDrawingOn C.toSimpleGraph := 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).