Add Kempe-chain structure of 4-colorings of edge-deletion subgraphs

For G_0 a minimum-order 5-chromatic maximal planar graph and any
4-coloring of G_0 - uv, the endpoints u, v must share a color, and the
color classes pairing that color with each of two other colors must
each induce a u-v path. The Kempe-chain parts follow from a standard
swap-on-component contradiction against the shared-color claim.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>

papers/flip_symmetric_maximal_planar_graphs/paper.aux

@@ -17,4 +17,5 @@
 \@writefile{toc}{\contentsline {section}{\tocsection {}{7}{Edge-deletion subgraphs}}{4}{}\protected@file@percent }
 \newlabel{def:edge-deletion}{{7.1}{4}}
 \newlabel{thm:edge-deletion-4colorable}{{7.2}{4}}
+\newlabel{thm:edge-deletion-coloring-structure}{{7.3}{4}}
 \gdef \@abspage@last{4}