Ordered adjacency in the graph with a directed bridge relation added
ProvedWilliamsonShmoys.bridge_augmented_graph_adj_iff__p2m_e1c10048_df1f_49a0_8080_5a203a611921_a3approximation-algorithmsplanar-graphstreewidth
For vertices in increasing order, adjacency in the supremum of H and the graph generated by the directed relation u to v is exactly original adjacency or the ordered pair (u,v). The hypothesis u < v fixes the orientation of the added edge.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.bridge_augmented_graph_adj_iff__p2m_e1c10048_df1f_49a0_8080_5a203a611921_a3
{V : Type} [LinearOrder V]
(H : SimpleGraph V) (u v : V) (huv : u < v) :
∀ a b, a < b →
((H ⊔ SimpleGraph.fromRel (fun x y => x = u ∧ y = v)).Adj a b ↔
H.Adj a b ∨ (a = u ∧ b = v)) := 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).