Joining distinct components preserves drawable planarity
OpenWilliamsonShmoys.planar_add_edge_between_nonreachable_vertices__p2m_71ebc69f_78e1_4174_9ed9_e68a3e8da3bb_a1approximation-algorithmsplanar-graphstreewidth
If two vertices lie in different connected components of a finite drawable graph, the graph has a strict drawable supergraph on the same vertices.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_add_edge_between_nonreachable_vertices__p2m_71ebc69f_78e1_4174_9ed9_e68a3e8da3bb_a1
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V) (u v : V)
(hsep : ¬ N.Reachable u v) (hN : HasPlanarDrawingOn N) :
∃ P : SimpleGraph V, N ≤ P ∧ P ≠ N ∧ HasPlanarDrawingOn P := 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).