Files
math-research/papers/flip_symmetric_maximal_planar_graphs/paper.aux
T
didericis f6144b98b5 Add edge-deletion subgraph 4-colorability for a minimal counterexample
Defines D(G) as the family of single-edge-deletion spanning subgraphs
of a maximal planar graph G, and shows that when G_0 is a minimum-order
5-chromatic maximal planar graph every member of D(G_0) is 4-colorable,
via a coloring pulled back from the smaller minor G_0/uv.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
2026-05-14 00:27:11 -04:00

21 lines
1.4 KiB
TeX

\relax
\@writefile{toc}{\contentsline {section}{\tocsection {}{1}{Motivation}}{1}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{2}{Preliminaries}}{1}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{3}{Flip-symmetric maximal planar graphs}}{1}{}\protected@file@percent }
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces An edge flip replaces the diagonal $uv$ of the quadrilateral $uwvx$ with the diagonal $wx$.}}{2}{}\protected@file@percent }
\newlabel{def:flip-symmetric}{{3.1}{2}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{4}{A minimal four-colorable counterexample}}{2}{}\protected@file@percent }
\newlabel{thm:min-five-chromatic-not-flip-symmetric}{{4.1}{2}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{5}{Flip symmetry frequency}}{2}{}\protected@file@percent }
\newlabel{sec:frequency}{{5}{2}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{6}{Further necessary properties of a minimal counterexample}}{3}{}\protected@file@percent }
\newlabel{tocindent-1}{0pt}
\newlabel{tocindent0}{0pt}
\newlabel{tocindent1}{17.77782pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}
\@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}}
\gdef \@abspage@last{4}