A drawable graph extends to a triangulation edge count
ProvedWilliamsonShmoys.planar_drawing_has_triangulation_edge_count_completionapproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite linearly ordered vertex type with at least three vertices is contained in a drawable graph on the same vertices with exactly 3|V| − 6 edges. For three vertices, the completion is the triangle; for larger sets, triangulate a maximal planar extension and count its edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_has_triangulation_edge_count_completion
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hCard : 3 ≤ Fintype.card V) :
∃ K : SimpleGraph V,
N ≤ K ∧ WilliamsonShmoys.HasPlanarDrawingOn K ∧
K.edgeSet.ncard = 3 * Fintype.card V - 6 := 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).