Move tire coloring transfer to restrictions paper

This commit is contained in:
2026-06-08 15:09:58 -04:00
parent c27ad69024
commit 6400fdfc5e
36 changed files with 372 additions and 336 deletions
+2 -2
View File
@@ -11,17 +11,17 @@ All papers are at `papers/<name>/paper.tex`. The current set:
| `colored_edge_flip_classes` | Colored Edge Flip Classes |
| `colored_pentagon_contractions` | Colored Pentagon Reductions |
| `coloring_nested_tire_dual_graphs` | Coloring Nested Tire Dual Graphs |
| `coloring_nested_tire_graphs` | Coloring Nested Tire Graphs |
| `even_level_graph_generators` | Even Level Graph Generators: a constructive conjecture stronger than the Four Color Theorem |
| `face_monochromatic_pairs` | Face-Monochromatic Pairs and the Four Colour Theorem |
| `iterated_reduction_in_reduced_dual` | An Iterated Reduction in the Reduced Dual |
| `level_resolutions_of_maximal_planar_graphs` | Level Resolutions of Maximal Planar Graphs |
| `level_switching` | Level Switching |
| `nested_tire_decompositions_of_plane_triangulations` | Nested Tire Decompositions of Plane Triangulations |
| `plane_depth` | Plane Depth |
| `plane_depth_sequencing` | Plane Depth Sequencing |
| `plane_diamond_coloring` | Plane Diamond Coloring |
The papers form a connected programme around plane triangulations, BFS-level structure, and the Four Colour Theorem. `plane_depth` introduces the level / dual-depth framework that downstream papers build on; `coloring_nested_tire_graphs` develops the tire-tread tree-of-treads decomposition.
The papers form a connected programme around plane triangulations, BFS-level structure, and the Four Colour Theorem. `plane_depth` introduces the level / dual-depth framework that downstream papers build on; `nested_tire_decompositions_of_plane_triangulations` develops the tire-tread tree-of-treads decomposition.
## Creating a New Paper
@@ -1,5 +1,5 @@
# Fdb version 3
["pdflatex"] 1779735598 "paper.tex" "paper.pdf" "paper" 1779735599
["pdflatex"] 1780945675 "paper.tex" "paper.pdf" "paper" 1780945676
"/usr/local/texlive/2022/texmf-dist/fonts/map/fontname/texfonts.map" 1577235249 3524 cb3e574dea2d1052e39280babc910dc8 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm" 1246382020 1004 54797486969f23fa377b128694d548df ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex8.tfm" 1246382020 988 bdf658c3bfc2d96d3c8b02cfc1c94c20 ""
@@ -19,20 +19,29 @@
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmsy8.tfm" 1136768653 1120 8b7d695260f3cff42e636090a8002094 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti10.tfm" 1136768653 1480 aa8e34af0eb6a2941b776984cf1dfdc4 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti8.tfm" 1136768653 1504 1747189e0441d1c18f3ea56fafc1c480 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmtt10.tfm" 1136768653 768 1321e9409b4137d6fb428ac9dc956269 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb" 1248133631 34811 78b52f49e893bcba91bd7581cdc144c0 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmcsc10.pfb" 1248133631 32001 6aeea3afe875097b1eb0da29acd61e28 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb" 1248133631 30251 6afa5cb1d0204815a708a080681d4674 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb" 1248133631 36299 5f9df58c2139e7edcf37c8fca4bd384d ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi5.pfb" 1248133631 37912 77d683123f92148345f3fc36a38d9ab1 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi6.pfb" 1248133631 37166 8ab3487cbe3ab49ebce74c29ea2418db ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi7.pfb" 1248133631 36281 c355509802a035cadc5f15869451dcee ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi8.pfb" 1248133631 35469 70d41d2b9ea31d5d813066df7c99281c ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb" 1248133631 35752 024fb6c41858982481f6968b5fc26508 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr5.pfb" 1248133631 31809 8670ca339bf94e56da1fc21c80635e2a ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr6.pfb" 1248133631 32734 69e00a6b65cedb993666e42eedb3d48f ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb" 1248133631 32762 224316ccc9ad3ca0423a14971cfa7fc1 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb" 1248133631 32726 0a1aea6fcd6468ee2cf64d891f5c43c8 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb" 1248133631 32569 5e5ddc8df908dea60932f3c484a54c0d ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy5.pfb" 1248133631 32915 7bf7720c61a5b3a7ff25b0964421c9b6 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy6.pfb" 1248133631 32587 1788b0c1c5b39540c96f5e42ccd6dae8 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb" 1248133631 32716 08e384dc442464e7285e891af9f45947 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy8.pfb" 1248133631 32626 4f5c1b83753b1dd3a97d1b399a005b4b ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb" 1248133631 37944 359e864bd06cde3b1cf57bb20757fb06 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.pfb" 1248133631 35660 fb24af7afbadb71801619f1415838111 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt10.pfb" 1248133631 31099 c85edf1dd5b9e826d67c9c7293b6786c ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb" 1248133631 31764 459c573c03a4949a528c2cc7f557e217 ""
"/usr/local/texlive/2022/texmf-dist/tex/context/base/mkii/supp-pdf.mkii" 1461363279 71627 94eb9990bed73c364d7f53f960cc8c5b ""
"/usr/local/texlive/2022/texmf-dist/tex/latex/amscls/amsart.cls" 1591045760 61881 a7369c346c2922a758ae6283cc1ed014 ""
"/usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/amsfonts.sty" 1359763108 5949 3f3fd50a8cc94c3d4cbf4fc66cd3df1c ""
@@ -57,10 +66,11 @@
"/usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map" 1647878959 4410336 7d30a02e9fa9a16d7d1f8d037ba69641 ""
"/usr/local/texlive/2022/texmf-var/web2c/pdftex/pdflatex.fmt" 1665017617 2826443 7e98410c533054b636c6470db83a27bc ""
"/usr/local/texlive/2022/texmf.cnf" 1647878952 577 209b46be99c9075fd74d4c0369380e8c ""
"fig_dual_depth.png" 1779482522 255786 cb48aab5aa40fc161d13a75df0544511 ""
"fig_tire_example.png" 1779735568 104494 8f9ce26b469b4236b8b67829f73a5faa ""
"paper.aux" 1779735599 1676 c48943a67a88ac2f325f17547e461f34 "pdflatex"
"paper.tex" 1779735594 8214 30f4cb9062b9c3d63d5799253be25ee9 ""
"fig_partial_tire_dual.png" 1779857443 150413 baa3a75b62a61f6004607ebc134bbcdb ""
"fig_partial_tire_dual_bridge.png" 1779857443 146308 b5a969d5cb06afe6df95f089e245389d ""
"notes/fig_facial_dual_choices.png" 1779764785 75684 fb3d8015cbfcfefef70a6a7b0426a90e ""
"paper.aux" 1780945676 4339 433ef9ccf9850298f581e204fe219c05 "pdflatex"
"paper.tex" 1780945614 21563 c81f7766fed2ceee40eae8b491033391 ""
(generated)
"paper.aux"
"paper.log"
@@ -1,4 +1,4 @@
PWD /Users/didericis/Code/math-research/papers/coloring_nested_tire_graphs
PWD /Users/didericis/Code/math-research/papers/coloring_nested_tire_dual_graphs
INPUT /usr/local/texlive/2022/texmf.cnf
INPUT /usr/local/texlive/2022/texmf-dist/web2c/texmf.cnf
INPUT /usr/local/texlive/2022/texmf-var/web2c/pdftex/pdflatex.fmt
@@ -225,30 +225,44 @@ INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam7
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti10.tfm
INPUT ./fig_dual_depth.png
INPUT ./fig_dual_depth.png
INPUT fig_dual_depth.png
INPUT ./fig_dual_depth.png
OUTPUT paper.pdf
INPUT ./fig_dual_depth.png
INPUT /usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map
INPUT ./fig_tire_example.png
INPUT ./fig_tire_example.png
INPUT fig_tire_example.png
INPUT ./fig_tire_example.png
INPUT ./fig_tire_example.png
INPUT ./fig_partial_tire_dual.png
INPUT ./fig_partial_tire_dual.png
INPUT fig_partial_tire_dual.png
INPUT ./fig_partial_tire_dual.png
INPUT ./fig_partial_tire_dual.png
INPUT ./fig_partial_tire_dual_bridge.png
INPUT ./fig_partial_tire_dual_bridge.png
INPUT fig_partial_tire_dual_bridge.png
INPUT ./fig_partial_tire_dual_bridge.png
INPUT ./fig_partial_tire_dual_bridge.png
INPUT ./notes/fig_facial_dual_choices.png
INPUT ./notes/fig_facial_dual_choices.png
INPUT notes/fig_facial_dual_choices.png
INPUT ./notes/fig_facial_dual_choices.png
INPUT ./notes/fig_facial_dual_choices.png
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmtt10.tfm
INPUT paper.aux
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmcsc10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi5.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi6.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi7.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi8.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr5.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr6.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy5.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy6.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy8.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb
@@ -1,4 +1,4 @@
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 27 MAY 2026 01:13
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 8 JUN 2026 15:07
entering extended mode
restricted \write18 enabled.
%&-line parsing enabled.
@@ -265,7 +265,7 @@ public/amsfonts/cm/cmti10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/p
ublic/amsfonts/cm/cmti8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/pub
lic/amsfonts/cm/cmtt10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/publ
ic/amsfonts/symbols/msam10.pfb>
Output written on paper.pdf (7 pages, 583446 bytes).
Output written on paper.pdf (7 pages, 583433 bytes).
PDF statistics:
145 PDF objects out of 1000 (max. 8388607)
85 compressed objects within 1 object stream
Binary file not shown.
@@ -469,7 +469,7 @@ manuscript (math-research repository), 2026.
\bibitem{bauerfeld-nested-tires}
E.~Bauerfeld,
\emph{Coloring Nested Tire Graphs},
\emph{Nested Tire Decompositions of Plane Triangulations},
manuscript (math-research repository), 2026.
\end{thebibliography}
@@ -10,7 +10,7 @@ the outer-face boundary of `O`.
Executable:
```bash
python3 papers/coloring_nested_tire_graphs/experiments/level_cycle_support.py
python3 papers/nested_tire_decompositions_of_plane_triangulations/experiments/level_cycle_support.py
```
## Model
@@ -35,7 +35,7 @@ of `C`.
Command:
```bash
python3 -u papers/coloring_nested_tire_graphs/experiments/level_cycle_support.py \
python3 -u papers/nested_tire_decompositions_of_plane_triangulations/experiments/level_cycle_support.py \
--n-min 3 --n-max 6 --outer-max 5 --inner-max 7 --max-chords 2 --max-paths 30
```
@@ -133,7 +133,7 @@ window for `n = 6`. The smallest admissible inner ring is `k = 7`
Command:
```bash
python3 -u papers/coloring_nested_tire_graphs/experiments/level_cycle_support.py \
python3 -u papers/nested_tire_decompositions_of_plane_triangulations/experiments/level_cycle_support.py \
--n-min 6 --n-max 6 --outer-min 3 --outer-max 6 --inner-min 7 --inner-max 8 \
--progress --examples 6
```
@@ -175,7 +175,7 @@ strictly *less* restrictive supports — never a new floor.
Command:
```bash
python3 -u papers/coloring_nested_tire_graphs/experiments/level_cycle_support.py \
python3 -u papers/nested_tire_decompositions_of_plane_triangulations/experiments/level_cycle_support.py \
--n-min 6 --n-max 6 --outer-min 3 --outer-max 7 --inner-min 7 --inner-max 9 \
--progress --examples 6
```
@@ -246,7 +246,7 @@ To probe the conjecture more directly we ran a "skip-`m=3`" sweep
explicitly excluding `m = 3` from the search:
```bash
python3 -u papers/coloring_nested_tire_graphs/experiments/level_cycle_support.py \
python3 -u papers/nested_tire_decompositions_of_plane_triangulations/experiments/level_cycle_support.py \
--n-min 6 --n-max 6 --outer-min 4 --outer-max 10 --inner-min 7 --inner-max 9 \
--progress
```

Before

Width:  |  Height:  |  Size: 250 KiB

After

Width:  |  Height:  |  Size: 250 KiB

Before

Width:  |  Height:  |  Size: 204 KiB

After

Width:  |  Height:  |  Size: 204 KiB

Before

Width:  |  Height:  |  Size: 391 KiB

After

Width:  |  Height:  |  Size: 391 KiB

Before

Width:  |  Height:  |  Size: 102 KiB

After

Width:  |  Height:  |  Size: 102 KiB

@@ -40,15 +40,12 @@
\newlabel{fig:inner-dual-annulus-case}{{5}{11}}
\newlabel{rem:hamilton-cycle-spoke-only}{{1.16}{11}}
\newlabel{rem:bridge-case-theta}{{1.17}{11}}
\citation{tait-original}
\newlabel{thm:tait-tire}{{1.18}{12}}
\newlabel{rem:count-general-outerplanar}{{1.19}{12}}
\newlabel{def:boundary-state-transfer}{{1.20}{13}}
\newlabel{thm:tire-chromatic-polynomial-transfer}{{1.21}{13}}
\newlabel{rem:spoke-only-chromatic-transfer}{{1.22}{14}}
\newlabel{thm:tread-tree}{{1.23}{14}}
\newlabel{rem:tree-multiple-children}{{1.24}{15}}
\newlabel{thm:tire-tree-decomposition}{{1.25}{15}}
\newlabel{thm:tread-tree}{{1.18}{12}}
\newlabel{rem:tree-multiple-children}{{1.19}{13}}
\newlabel{thm:tire-tree-decomposition}{{1.20}{13}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Tire-tree decomposition (Theorem\nonbreakingspace 1.20\hbox {}) on a $13$-vertex maximal planar example $G$ with five BFS levels. $(a)$ $G$ with vertex source $v_0$ and $\ell _G \in \{0,1,2,3,4\}$; four nested seams are highlighted, $C_{T_R} = \{a,b,c\}$ (orange), $C_{T_L} = \{a,c,d\}$ (red, including the chord $a$-$c$ shared with $C_{T_R}$), $C_{T_{LL}} = \{f_1, f_2, f_3\}$ (purple), $C_{T_{LLL}} = \{g_1, g_2, g_3\}$ (teal). Inset: the rooted tree of tire treads $\mathcal {T}(G, \{v_0\})$ branches at $T_0$ into the leaf $T_R$ (containing $e$) and a chain $T_L \to T_{LL} \to T_{LLL}$ (the highlighted sub-tree). $(b)$ The disk $G_{T_L}$ inside the seam $C_{T_L}$, drawn standalone with $C_{T_L}$ as cycle source and vertex labels rotated to match the new (cycle-source) role of the boundary triangle. $\ell _{G_{T_L}}(\cdot ) = \ell _G(\cdot ) - 1$ on $V(G_{T_L})$ (verified by the generator script), and $\mathcal {T}(G_{T_L}, C_{T_L})$ is the chain $T_L \to T_{LL} \to T_{LLL}$, iso to the highlighted sub-tree of $(a)$.}}{15}{}\protected@file@percent }
\newlabel{fig:tire-tree-decomposition}{{6}{15}}
\newlabel{rem:tree-coloring-factorisation}{{1.21}{15}}
\bibcite{tait-original}{1}
\bibcite{bauerfeld-depth}{2}
\bibcite{bauerfeld-nested-tire-duals}{3}
@@ -65,8 +62,5 @@
\newlabel{tocindent1}{17.77782pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}
\newlabel{rem:tree-coloring-factorisation}{{1.26}{17}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{17}{}\protected@file@percent }
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Tire-tree decomposition (Theorem\nonbreakingspace 1.25\hbox {}) on a $13$-vertex maximal planar example $G$ with five BFS levels. $(a)$ $G$ with vertex source $v_0$ and $\ell _G \in \{0,1,2,3,4\}$; four nested seams are highlighted, $C_{T_R} = \{a,b,c\}$ (orange), $C_{T_L} = \{a,c,d\}$ (red, including the chord $a$-$c$ shared with $C_{T_R}$), $C_{T_{LL}} = \{f_1, f_2, f_3\}$ (purple), $C_{T_{LLL}} = \{g_1, g_2, g_3\}$ (teal). Inset: the rooted tree of tire treads $\mathcal {T}(G, \{v_0\})$ branches at $T_0$ into the leaf $T_R$ (containing $e$) and a chain $T_L \to T_{LL} \to T_{LLL}$ (the highlighted sub-tree). $(b)$ The disk $G_{T_L}$ inside the seam $C_{T_L}$, drawn standalone with $C_{T_L}$ as cycle source and vertex labels rotated to match the new (cycle-source) role of the boundary triangle. $\ell _{G_{T_L}}(\cdot ) = \ell _G(\cdot ) - 1$ on $V(G_{T_L})$ (verified by the generator script), and $\mathcal {T}(G_{T_L}, C_{T_L})$ is the chain $T_L \to T_{LL} \to T_{LLL}$, iso to the highlighted sub-tree of $(a)$.}}{18}{}\protected@file@percent }
\newlabel{fig:tire-tree-decomposition}{{6}{18}}
\gdef \@abspage@last{18}
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{16}{}\protected@file@percent }
\gdef \@abspage@last{16}
@@ -1,5 +1,5 @@
# Fdb version 3
["pdflatex"] 1780944443 "paper.tex" "paper.pdf" "paper" 1780944444
["pdflatex"] 1780945550 "paper.tex" "paper.pdf" "paper" 1780945552
"/usr/local/texlive/2022/texmf-dist/fonts/map/fontname/texfonts.map" 1577235249 3524 cb3e574dea2d1052e39280babc910dc8 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm" 1246382020 1004 54797486969f23fa377b128694d548df ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex8.tfm" 1246382020 988 bdf658c3bfc2d96d3c8b02cfc1c94c20 ""
@@ -143,8 +143,8 @@
"fig_medial_tire_example.png" 1780943640 209003 4349824e4f016bde4b938be6b2cb5b2c ""
"fig_tire_example.png" 1779857443 104494 8f9ce26b469b4236b8b67829f73a5faa ""
"fig_tire_tree_decomposition.png" 1780290287 372371 1b44f5a3e9f637d78ae951b1f2e3a89d ""
"paper.aux" 1780944444 7237 ad56df69e173b3ef29a32273960fe919 "pdflatex"
"paper.tex" 1780944408 69767 384639d36c3a81504fdd37ae395860bb ""
"paper.aux" 1780945552 6952 b88a9a8b764572f2fc3be94aabc8b157 "pdflatex"
"paper.tex" 1780945491 60644 1d96ad32143c562e73fccdfacbbc9be2 ""
(generated)
"paper.aux"
"paper.log"
@@ -1,4 +1,4 @@
PWD /Users/didericis/Code/math-research/papers/coloring_nested_tire_graphs
PWD /Users/didericis/Code/math-research/papers/nested_tire_decompositions_of_plane_triangulations
INPUT /usr/local/texlive/2022/texmf.cnf
INPUT /usr/local/texlive/2022/texmf-dist/web2c/texmf.cnf
INPUT /usr/local/texlive/2022/texmf-var/web2c/pdftex/pdflatex.fmt
@@ -1,4 +1,4 @@
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 8 JUN 2026 14:47
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 8 JUN 2026 15:05
entering extended mode
restricted \write18 enabled.
%&-line parsing enabled.
@@ -524,55 +524,55 @@ LaTeX Warning: `h' float specifier changed to `ht'.
LaTeX Warning: `h' float specifier changed to `ht'.
[9] [10] [11] [12] [13] [14] [15] [16]
<fig_tire_tree_decomposition.png, id=86, 1101.3145pt x 633.9685pt>
[9] [10] [11]
Underfull \vbox (badness 1635) has occurred while \output is active []
[12]
[13] [14]
<fig_tire_tree_decomposition.png, id=80, 1101.3145pt x 633.9685pt>
File: fig_tire_tree_decomposition.png Graphic file (type png)
<use fig_tire_tree_decomposition.png>
Package pdftex.def Info: fig_tire_tree_decomposition.png used on input line 13
32.
Package pdftex.def Info: fig_tire_tree_decomposition.png used on input line 11
53.
(pdftex.def) Requested size: 341.9989pt x 196.86678pt.
LaTeX Warning: `h' float specifier changed to `ht'.
[17] [18 <./fig_tire_tree_decomposition.png>] (./paper.aux) )
[15 <./fig_tire_tree_decomposition.png>] [16] (./paper.aux) )
Here is how much of TeX's memory you used:
14081 strings out of 478268
280188 string characters out of 5846347
565505 words of memory out of 5000000
31903 multiletter control sequences out of 15000+600000
14076 strings out of 478268
280038 string characters out of 5846347
565445 words of memory out of 5000000
31898 multiletter control sequences out of 15000+600000
478218 words of font info for 62 fonts, out of 8000000 for 9000
1302 hyphenation exceptions out of 8191
84i,12n,89p,1168b,801s stack positions out of 10000i,1000n,20000p,200000b,200000s
</usr/local/texliv
e/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb></usr/local/texlive
/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx8.pfb></usr/local/texlive/2
022/texmf-dist/fonts/type1/public/amsfonts/cm/cmcsc10.pfb></usr/local/texlive/2
022/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb></usr/local/texlive/20
22/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb></usr/local/texlive/202
2/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi5.pfb></usr/local/texlive/2022/
texmf-dist/fonts/type1/public/amsfonts/cm/cmmi7.pfb></usr/local/texlive/2022/te
xmf-dist/fonts/type1/public/amsfonts/cm/cmmi8.pfb></usr/local/texlive/2022/texm
f-dist/fonts/type1/public/amsfonts/cm/cmmi9.pfb></usr/local/texlive/2022/texmf-
dist/fonts/type1/public/amsfonts/cm/cmr10.pfb></usr/local/texlive/2022/texmf-di
st/fonts/type1/public/amsfonts/cm/cmr5.pfb></usr/local/texlive/2022/texmf-dist/
fonts/type1/public/amsfonts/cm/cmr6.pfb></usr/local/texlive/2022/texmf-dist/fon
ts/type1/public/amsfonts/cm/cmr7.pfb></usr/local/texlive/2022/texmf-dist/fonts/
type1/public/amsfonts/cm/cmr8.pfb></usr/local/texlive/2022/texmf-dist/fonts/typ
e1/public/amsfonts/cm/cmr9.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/
public/amsfonts/cm/cmsy10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/p
ublic/amsfonts/cm/cmsy5.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/pub
lic/amsfonts/cm/cmsy6.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/publi
c/amsfonts/cm/cmsy7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/
amsfonts/cm/cmsy9.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/am
sfonts/cm/cmti10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/ams
fonts/cm/cmti8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfo
nts/symbols/msam10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/a
msfonts/symbols/msbm10.pfb>
Output written on paper.pdf (18 pages, 1096120 bytes).
</usr/local/texli
ve/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb></usr/local/texliv
e/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx8.pfb></usr/local/texlive/
2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmcsc10.pfb></usr/local/texlive/
2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb></usr/local/texlive/2
022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb></usr/local/texlive/20
22/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi5.pfb></usr/local/texlive/2022
/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi7.pfb></usr/local/texlive/2022/t
exmf-dist/fonts/type1/public/amsfonts/cm/cmmi8.pfb></usr/local/texlive/2022/tex
mf-dist/fonts/type1/public/amsfonts/cm/cmmi9.pfb></usr/local/texlive/2022/texmf
-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb></usr/local/texlive/2022/texmf-d
ist/fonts/type1/public/amsfonts/cm/cmr5.pfb></usr/local/texlive/2022/texmf-dist
/fonts/type1/public/amsfonts/cm/cmr6.pfb></usr/local/texlive/2022/texmf-dist/fo
nts/type1/public/amsfonts/cm/cmr7.pfb></usr/local/texlive/2022/texmf-dist/fonts
/type1/public/amsfonts/cm/cmr8.pfb></usr/local/texlive/2022/texmf-dist/fonts/ty
pe1/public/amsfonts/cm/cmr9.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1
/public/amsfonts/cm/cmsy10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/
public/amsfonts/cm/cmsy5.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/pu
blic/amsfonts/cm/cmsy6.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/publ
ic/amsfonts/cm/cmsy7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public
/amsfonts/cm/cmsy9.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/a
msfonts/cm/cmti10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/am
sfonts/cm/cmti8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsf
onts/symbols/msam10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/
amsfonts/symbols/msbm10.pfb>
Output written on paper.pdf (16 pages, 1082268 bytes).
PDF statistics:
195 PDF objects out of 1000 (max. 8388607)
117 compressed objects within 2 object streams
189 PDF objects out of 1000 (max. 8388607)
113 compressed objects within 2 object streams
0 named destinations out of 1000 (max. 500000)
33 words of extra memory for PDF output out of 10000 (max. 10000000)
@@ -894,185 +894,6 @@ and so contributes no degree-$2$ branch vertex), hence is
outerplanar as predicted.
\end{remark}
\begin{theorem}[Tait correspondence: 4-colorings of a tire vs 3-edge-colorings of its inner dual]
\label{thm:tait-tire}
Let $T = (B_{\mathrm{out}}, O, E_{\mathrm{ann}})$ be a tire graph
(viewed as an annular triangulation of its tire tread $R$) and let
$\Gamma$ be its inner dual
(Theorem~\ref{thm:inner-dual-outerplanar}). Then
\[
\#\bigl\{\text{proper $4$-vertex-colorings of } T\bigr\} \big/ |S_4|
\;=\;
\#\bigl\{\text{proper $3$-edge-colorings of } \Gamma\bigr\} \big/ |S_3|.
\]
That is, the number of $4$-vertex-colorings of $T$ up to permutation
of the colour set $\{0, 1, 2, 3\}$ equals the number of
$3$-edge-colorings of $\Gamma$ up to permutation of the colour set
$\{1, 2, 3\}$.
\end{theorem}
\begin{proof}
The argument is the classical Tait correspondence
\cite{tait-original} adapted to the annular triangulation $T$.
Encode the four colours of a proper $4$-vertex-coloring $c \colon
V(T) \to \mathbb{Z}_2 \times \mathbb{Z}_2$. For each interior
annular edge $e$ of $T$ (whose two incident faces both lie in
$F_{\mathrm{ann}}$, contributing a $\Gamma$-edge $e^*$), set
\[
\chi^*(e^*) \;:=\; c(u) + c(v) \in \mathbb{Z}_2 \times \mathbb{Z}_2,
\qquad \text{where } u, v \text{ are the endpoints of } e.
\]
Since $c(u) \ne c(v)$, we have $\chi^*(e^*) \ne 00$, so $\chi^*$
takes values in $\{01, 10, 11\}$, which we identify with the
$3$-edge-coloring palette $\{1, 2, 3\}$.
\emph{Properness.} At each $\Gamma$-vertex $d_f$ corresponding to
an annular triangle $f = \{u, v, w\}$, the three incident
$\Gamma$-edges (one per cycle-edge of $f$) carry colours
$c(u) + c(v),\; c(v) + c(w),\; c(u) + c(w)$. These three elements
of $\mathbb{Z}_2 \times \mathbb{Z}_2$ sum to $0$ and are pairwise
distinct (their pairwise differences are
$c(u) - c(w),\; c(v) - c(u),\; c(w) - c(v)$, each nonzero), so
they form a permutation of $\{01, 10, 11\}$ --- a proper edge
colouring at $d_f$.
\emph{Surjectivity onto cosets.} Given a proper $3$-edge-coloring
$\chi^*$ of $\Gamma$, the equation $c(u) + c(v) = \chi^*(e^*)$
admits exactly $|\mathbb{Z}_2 \times \mathbb{Z}_2| = 4$ solutions
$c \colon V(T) \to \mathbb{Z}_2 \times \mathbb{Z}_2$ (a global
translation is the only freedom). Hence the map $c \mapsto
\chi^*$ is $4$-to-$1$.
\emph{Count.} Therefore $\#\{\text{4-colorings of } T\} = 4 \cdot
\#\{\text{3-edge-colorings of } \Gamma\}$. Dividing by $|S_4|
= 24$ on the left and $|S_3| = 6$ on the right (since $S_4$ acts
faithfully on the $4$-colorings and $S_3$ on the $3$-edge-colorings,
and the $4$-to-$1$ map respects the $S_4/S_3 \cong S_3$ quotient
via the natural surjection $S_4 \twoheadrightarrow S_3$) gives the
stated equality.
\end{proof}
\begin{remark}
\label{rem:count-general-outerplanar}
Theorem~\ref{thm:tait-tire} reduces the $4$-colouring count of a
tire to the $3$-edge-coloring count of its outerplanar inner dual
$\Gamma$. For the cycle case $\Gamma \cong C_{\mu+\nu}$ (the spoke-only
case of Remark~\ref{rem:hamilton-cycle-spoke-only}), the cycle
chromatic polynomial at $3$ colours gives
$2^{\mu+\nu} + 2 (-1)^{\mu+\nu}$. For an inner dual with one or more
non-crossing chords, the count depends on the chord structure, not just
on the pair (number of vertices, number of chords): two outerplanar
graphs with the same number of vertices and number of chords can have
different proper
$3$-edge-coloring counts depending on how the chords are arranged
(nested, sequential, sharing vertices, etc.). Every such count
can nevertheless be computed in linear time by tree-decomposition
methods, since outerplanar graphs have treewidth at most $2$ and
the edge-chromatic polynomial admits a deletion--contraction
recursion that respects the cycle-plus-chord structure.
\end{remark}
\begin{definition}[Boundary-state chromatic transfer]
\label{def:boundary-state-transfer}
Let $T = (B_{\mathrm{out}}, O, E_{\mathrm{ann}})$ be a tire graph.
Choose a cut along one annular edge if both boundaries are
non-degenerate; in the degenerate case make no cut. The tread becomes
a triangulated disk $\widetilde R$. Let
\[
f_1, f_2, \ldots, f_m
\]
be any shelling order of the triangular faces of $\widetilde R$, i.e.\
an order in which each initial union
$\widetilde R_i := f_1 \cup \cdots \cup f_i$ is a disk. Such an order
is obtained by taking an outerplanar embedding of the inner dual
$\Gamma$ from Theorem~\ref{thm:inner-dual-outerplanar} and repeatedly
removing an outer-face ear.
For each $i$, let $A_i$ be the \emph{frontier}: the vertices of
$T$ incident to at least one processed face in $\widetilde R_i$ and to
at least one still-unprocessed constraint, where the unprocessed
constraints are the remaining annular faces together with any edge of
$O$ not yet tested by the transfer. A \emph{boundary state} on $A_i$
is a partition $\pi$ of $A_i$ into colour classes, subject to the
condition that adjacent vertices of $T[A_i]$ lie in distinct blocks.
We write $r(\pi)$ for the number of blocks of $\pi$.
\end{definition}
\begin{theorem}[Chromatic polynomial of a tire by frontier transfer]
\label{thm:tire-chromatic-polynomial-transfer}
For every tire graph $T$, the chromatic polynomial $P_T(q)$ is
computed by the following boundary-state dynamic program.
Initialize the table at $i=0$ with the empty frontier state of weight
$1$. When the next triangular face
$f_i = \{x,y,z\}$ is attached, pass from states on $A_{i-1}$ to states
on $A_i$ as follows.
\begin{enumerate}
\item[(1)] Introduce any vertices of $f_i$ not already present in
$A_{i-1}$, assigning each such vertex either to an existing
colour block not containing one of its already-coloured
neighbours, or to a new block.
\item[(2)] Reject every assignment in which two adjacent vertices of
the triangle $f_i$ lie in the same block. Also reject every
assignment in which an edge of $O$ whose two endpoints have
now both appeared for the first time as a tested pair has
both endpoints in the same block. Thus chords and bridges of
the inner outerplanar graph are enforced exactly when their
second endpoint becomes visible to the transfer.
\item[(3)] Delete from the state every vertex no longer incident to an
unprocessed constraint. If deleting a vertex removes the last
representative of its colour block from the frontier, multiply
that transition by $1$; the colour has already been chosen.
\item[(4)] If a new vertex is assigned to a new colour block while the
current frontier state has $r$ colour blocks, multiply that
transition by $q-r$. If several new colour blocks are created
in the same triangle, the factors are
$(q-r)(q-r-1)\cdots$ in the order of creation.
\end{enumerate}
After $f_m$ is processed, the frontier is empty. The single remaining
weight is $P_T(q)$.
\end{theorem}
\begin{proof}
The construction is the standard transfer for the chromatic polynomial,
specialized to the tire shelling. The frontier state records exactly
the equality pattern among colours that can still affect unprocessed
faces. Since colour names are irrelevant to the chromatic polynomial,
states are quotiented by the natural action of the symmetric group on
the colour set; a state with $r$ visible colour blocks can be extended
by a genuinely new colour in $q-r$ ways.
Each transition accounts for all proper colourings of the enlarged
processed disk $\widetilde R_i$ that restrict to the resulting frontier
state, and accounts for none that violate an edge of the newly attached
triangle or untested edge of $O$. Vertices removed from the frontier
have no future incident unprocessed constraint, so their actual colour
names can no longer influence compatibility and may be forgotten.
Induction on $i$ therefore shows
that the table after step $i$ is precisely the orbit-count generating
function for proper colourings of $\widetilde R_i$ by frontier state.
At $i=m$ no vertices remain active, so the accumulated weight counts all
proper colourings of $T$. Because the weights are polynomials in $q$,
this count is the full chromatic polynomial.
\end{proof}
\begin{remark}[Spoke-only transfer matrix]
\label{rem:spoke-only-chromatic-transfer}
In the spoke-only case with both boundaries simple cycles, the method
has a particularly small form. Cut the annulus along one spoke and
walk around the resulting strip. Each step adds one triangle sharing
an edge with the previous processed strip, so the frontier consists of
two or three consecutive boundary vertices. Up to colour permutation
there are only the possible equality patterns among those active
vertices, with adjacent vertices required to be distinct. The
chromatic polynomial is therefore the trace of a finite transfer matrix
whose entries are polynomials in $q$; the matrix depends only on the
local triangle type encountered while walking around the tread. Chords
or cut-vertices of $O$ enlarge the frontier only at the corresponding
outerplanar ears, and are handled by the same state rule of
Theorem~\ref{thm:tire-chromatic-polynomial-transfer}.
\end{remark}
\begin{theorem}[Tire treads form a rooted tree under face containment]
\label{thm:tread-tree}
Let $G$ be a maximal planar graph with planar embedding $\Pi_G$
@@ -13,40 +13,52 @@
\@writefile{toc}{\contentsline {section}{\tocsection {}{1}{Introduction}}{1}{}\protected@file@percent }
\@writefile{toc}{\contentsline {paragraph}{\tocparagraph {}{}{Related work.}}{1}{}\protected@file@percent }
\citation{bauerfeld-nested-tire-decompositions}
\citation{bauerfeld-nested-tire-decompositions}
\citation{tait-original}
\@writefile{toc}{\contentsline {section}{\tocsection {}{2}{Background from nested tire decompositions}}{2}{}\protected@file@percent }
\newlabel{rem:level-cycle-motivation}{{2.1}{2}}
\newlabel{def:level-cycle-three-colour-restriction}{{2.2}{2}}
\newlabel{conj:false-universal-level-cycle-three-colour}{{2.3}{2}}
\newlabel{ex:universal-level-cycle-counterexample}{{2.4}{2}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces The $8$-vertex counterexample to the universal-source form. With source $S=\{7\}$, the level cycle $(3,4,5,8)$ lies in $L_2$ and forces all four colours in every proper $4$-vertex-colouring.}}{3}{}\protected@file@percent }
\newlabel{fig:universal-level-cycle-counterexample}{{1}{3}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{An inner-boundary refinement}}{3}{}\protected@file@percent }
\newlabel{def:tire-inner-boundary-three-colour}{{2.5}{3}}
\newlabel{conj:tire-inner-boundary-three-colour}{{2.6}{4}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{A counterexample at $n=14$}}{4}{}\protected@file@percent }
\newlabel{ex:inner-boundary-counterexample}{{2.7}{4}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The $14$-vertex counterexample $G^\star $ to Conjecture\nonbreakingspace 2.6\hbox {} in a planar embedding. The six degree-$3$ vertices split into two triples, $\{3,5,10\}$ each adjacent to a triangle in the core $\{1,2,4,6\}$, and $\{11,13,14\}$ each adjacent to a triangle in the core $\{7,8,9,12\}$; the two cores are joined by the edges $17,28,69$ together with $12$.}}{4}{}\protected@file@percent }
\newlabel{fig:inner-boundary-counterexample}{{2}{4}}
\citation{bauerfeld-nested-tire-decompositions}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{The surviving level-cycle conjecture}}{5}{}\protected@file@percent }
\newlabel{conj:level-cycle-three-colour}{{2.8}{5}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{Enumeration for small $n$}}{5}{}\protected@file@percent }
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Exhaustive vertex-source search for the level-cycle three-colour conjecture on all triangulation isomorphism classes with $4 \leq n \leq 13$. Every triangulation in this range admits at least one vertex source witnessing the conjecture.}}{5}{}\protected@file@percent }
\newlabel{tab:level-cycle-three-colour-counts}{{1}{5}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{The $5$-connected slice at $n \leq 24$}}{5}{}\protected@file@percent }
\newlabel{def:seam}{{2.9}{5}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{3}{Single-tire colouring transfer}}{2}{}\protected@file@percent }
\newlabel{thm:tait-tire}{{3.1}{2}}
\citation{bauerfeld-nested-tire-decompositions}
\citation{bauerfeld-nested-tire-decompositions}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The $5$-connected triangulations at $14 \leq n \leq 24$ generated by \texttt {plantri -c5 -a}. All $9732$ graphs in this slice admit a vertex source witnessing the level-cycle three-colour conjecture.}}{6}{}\protected@file@percent }
\newlabel{tab:level-cycle-three-colour-c5-14-16}{{2}{6}}
\newlabel{def:partial-tire-tree}{{2.10}{6}}
\newlabel{lem:seam-edge-shared}{{2.11}{6}}
\newlabel{rem:count-general-outerplanar}{{3.2}{3}}
\newlabel{def:boundary-state-transfer}{{3.3}{3}}
\newlabel{thm:tire-chromatic-polynomial-transfer}{{3.4}{3}}
\newlabel{rem:spoke-only-chromatic-transfer}{{3.5}{4}}
\newlabel{rem:level-cycle-motivation}{{3.6}{4}}
\newlabel{def:level-cycle-three-colour-restriction}{{3.7}{4}}
\newlabel{conj:false-universal-level-cycle-three-colour}{{3.8}{5}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces The $8$-vertex counterexample to the universal-source form. With source $S=\{7\}$, the level cycle $(3,4,5,8)$ lies in $L_2$ and forces all four colours in every proper $4$-vertex-colouring.}}{5}{}\protected@file@percent }
\newlabel{fig:universal-level-cycle-counterexample}{{1}{5}}
\newlabel{ex:universal-level-cycle-counterexample}{{3.9}{5}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{An inner-boundary refinement}}{6}{}\protected@file@percent }
\newlabel{def:tire-inner-boundary-three-colour}{{3.10}{6}}
\newlabel{conj:tire-inner-boundary-three-colour}{{3.11}{6}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{A counterexample at $n=14$}}{6}{}\protected@file@percent }
\newlabel{ex:inner-boundary-counterexample}{{3.12}{6}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The $14$-vertex counterexample $G^\star $ to Conjecture\nonbreakingspace 3.11\hbox {} in a planar embedding. The six degree-$3$ vertices split into two triples, $\{3,5,10\}$ each adjacent to a triangle in the core $\{1,2,4,6\}$, and $\{11,13,14\}$ each adjacent to a triangle in the core $\{7,8,9,12\}$; the two cores are joined by the edges $17,28,69$ together with $12$.}}{7}{}\protected@file@percent }
\newlabel{fig:inner-boundary-counterexample}{{2}{7}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{The surviving level-cycle conjecture}}{7}{}\protected@file@percent }
\newlabel{conj:level-cycle-three-colour}{{3.13}{7}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{Enumeration for small $n$}}{7}{}\protected@file@percent }
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Exhaustive vertex-source search for the level-cycle three-colour conjecture on all triangulation isomorphism classes with $4 \leq n \leq 13$. Every triangulation in this range admits at least one vertex source witnessing the conjecture.}}{7}{}\protected@file@percent }
\newlabel{tab:level-cycle-three-colour-counts}{{1}{7}}
\citation{bauerfeld-nested-tire-decompositions}
\citation{bauerfeld-nested-tire-decompositions}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{The $5$-connected slice at $n \leq 24$}}{8}{}\protected@file@percent }
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The $5$-connected triangulations at $14 \leq n \leq 24$ generated by \texttt {plantri -c5 -a}. All $9732$ graphs in this slice admit a vertex source witnessing the level-cycle three-colour conjecture.}}{8}{}\protected@file@percent }
\newlabel{tab:level-cycle-three-colour-c5-14-16}{{2}{8}}
\newlabel{def:seam}{{3.14}{8}}
\newlabel{def:partial-tire-tree}{{3.15}{8}}
\newlabel{lem:seam-edge-shared}{{3.16}{8}}
\citation{bauerfeld-nested-tire-decompositions}
\citation{bauerfeld-nested-tire-decompositions}
\bibcite{tait-original}{1}
\bibcite{bauerfeld-depth}{2}
\bibcite{bauerfeld-nested-tire-decompositions}{3}
\bibcite{bauerfeld-nested-tire-duals}{4}
\bibcite{birkhoff-reducibility}{5}
\newlabel{conj:seam-counterexample}{{3.17}{9}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{9}{}\protected@file@percent }
\bibcite{birkhoff-lewis-chromatic}{6}
\bibcite{tutte-four-colour-conjecture}{7}
\bibcite{tutte-algebraic-colorings}{8}
@@ -59,6 +71,4 @@
\newlabel{tocindent1}{17.77782pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}
\newlabel{conj:seam-counterexample}{{2.12}{7}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{7}{}\protected@file@percent }
\gdef \@abspage@last{8}
\gdef \@abspage@last{10}
@@ -1,5 +1,5 @@
# Fdb version 3
["pdflatex"] 1780944697 "paper.tex" "paper.pdf" "paper" 1780944698
["pdflatex"] 1780945548 "paper.tex" "paper.pdf" "paper" 1780945549
"/usr/local/texlive/2022/texmf-dist/fonts/map/fontname/texfonts.map" 1577235249 3524 cb3e574dea2d1052e39280babc910dc8 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm" 1246382020 1004 54797486969f23fa377b128694d548df ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex8.tfm" 1246382020 988 bdf658c3bfc2d96d3c8b02cfc1c94c20 ""
@@ -23,6 +23,7 @@
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmsy8.tfm" 1136768653 1120 8b7d695260f3cff42e636090a8002094 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmsy9.tfm" 1136768653 1116 25a7bf822c58caf309a702ef79f4afbb ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti10.tfm" 1136768653 1480 aa8e34af0eb6a2941b776984cf1dfdc4 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti7.tfm" 1136768653 1492 86331993fe614793f5e7e755835c31c5 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti8.tfm" 1136768653 1504 1747189e0441d1c18f3ea56fafc1c480 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmtt10.tfm" 1136768653 768 1321e9409b4137d6fb428ac9dc956269 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb" 1248133631 34811 78b52f49e893bcba91bd7581cdc144c0 ""
@@ -45,6 +46,7 @@
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.pfb" 1248133631 35660 fb24af7afbadb71801619f1415838111 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt10.pfb" 1248133631 31099 c85edf1dd5b9e826d67c9c7293b6786c ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb" 1248133631 31764 459c573c03a4949a528c2cc7f557e217 ""
"/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msbm10.pfb" 1248133631 34694 ad62b13721ee8eda1dcc8993c8bd7041 ""
"/usr/local/texlive/2022/texmf-dist/tex/context/base/mkii/supp-pdf.mkii" 1461363279 71627 94eb9990bed73c364d7f53f960cc8c5b ""
"/usr/local/texlive/2022/texmf-dist/tex/generic/pgf/basiclayer/pgfcore.code.tex" 1601326656 992 855ff26741653ab54814101ca36e153c ""
"/usr/local/texlive/2022/texmf-dist/tex/generic/pgf/basiclayer/pgfcorearrows.code.tex" 1601326656 43820 1fef971b75380574ab35a0d37fd92608 ""
@@ -137,8 +139,8 @@
"/usr/local/texlive/2022/texmf.cnf" 1647878952 577 209b46be99c9075fd74d4c0369380e8c ""
"fig_inner_boundary_counterexample.png" 1780944385 86866 e15e4311e42fec20179ac6bb90683dea ""
"fig_universal_level_cycle_counterexample.png" 1780944385 75145 08f600be4e05c11d702bee45996ca222 ""
"paper.aux" 1780944698 4645 3a869b72856c307c3826ab1685ff7923 "pdflatex"
"paper.tex" 1780944666 24042 8f637a21193743241488dc904c5838c7 ""
"paper.aux" 1780945549 5193 903d3a13f7d3eebd35cc6c18bf5aeb2c "pdflatex"
"paper.tex" 1780945514 33235 97c16b33062815b5f93e786c4b659c28 ""
(generated)
"paper.aux"
"paper.log"
@@ -449,6 +449,8 @@ INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti10.tfm
OUTPUT paper.pdf
INPUT /usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti7.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti7.tfm
INPUT ./fig_universal_level_cycle_counterexample.png
INPUT ./fig_universal_level_cycle_counterexample.png
INPUT fig_universal_level_cycle_counterexample.png
@@ -487,3 +489,4 @@ INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.p
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb
INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msbm10.pfb
@@ -1,4 +1,4 @@
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 8 JUN 2026 14:51
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 8 JUN 2026 15:05
entering extended mode
restricted \write18 enabled.
%&-line parsing enabled.
@@ -495,61 +495,62 @@ File: epstopdf-sys.cfg 2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Liv
e
))
[1{/usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map}]
<fig_universal_level_cycle_counterexample.png, id=18, 614.295pt x 343.2825pt>
[2] [3] [4]
<fig_universal_level_cycle_counterexample.png, id=32, 614.295pt x 343.2825pt>
File: fig_universal_level_cycle_counterexample.png Graphic file (type png)
<use fig_universal_level_cycle_counterexample.png>
Package pdftex.def Info: fig_universal_level_cycle_counterexample.png used on
input line 162.
input line 343.
(pdftex.def) Requested size: 280.79956pt x 156.91663pt.
[2] [3 <./fig_universal_level_cycle_counterexample.png>]
<fig_inner_boundary_counterexample.png, id=29, 584.584pt x 324.8135pt>
[5 <./fig_universal_level_cycle_counterexample.png>]
<fig_inner_boundary_counterexample.png, id=38, 584.584pt x 324.8135pt>
File: fig_inner_boundary_counterexample.png Graphic file (type png)
<use fig_inner_boundary_counterexample.png>
Package pdftex.def Info: fig_inner_boundary_counterexample.png used on input l
ine 270.
ine 451.
(pdftex.def) Requested size: 280.79956pt x 156.02269pt.
[4 <./fig_inner_boundary_counterexample.png>] [5] [6]
Overfull \hbox (1.78508pt too wide) in paragraph at lines 462--464
[6] [7 <./fig_inner_boundary_counterexample.png>] [8]
Overfull \hbox (1.78508pt too wide) in paragraph at lines 643--645
[]\OT1/cmr/m/n/10 Length lower bound (Birkhoff). \OT1/cmr/m/it/10 Ev-ery non-tr
ivial seam $\OML/cmm/m/it/10 C$ \OT1/cmr/m/it/10 of $\OML/cmm/m/it/10 G$ \OT1/c
mr/m/it/10 has $\OMS/cmsy/m/n/10 j\OML/cmm/m/it/10 V\OT1/cmr/m/n/10 (\OML/cmm/m
/it/10 C\OT1/cmr/m/n/10 )\OMS/cmsy/m/n/10 j ^^U
[]
[7] [8] (./paper.aux) )
[9] [10] (./paper.aux) )
Here is how much of TeX's memory you used:
13582 strings out of 478268
271682 string characters out of 5846347
540742 words of memory out of 5000000
31407 multiletter control sequences out of 15000+600000
477688 words of font info for 61 fonts, out of 8000000 for 9000
13590 strings out of 478268
271865 string characters out of 5846347
540799 words of memory out of 5000000
31414 multiletter control sequences out of 15000+600000
478386 words of font info for 63 fonts, out of 8000000 for 9000
1302 hyphenation exceptions out of 8191
84i,9n,89p,833b,289s stack positions out of 10000i,1000n,20000p,200000b,200000s
</usr/local/texlive/2022/texmf-dist/fonts/type1/public/a
msfonts/cm/cmbx10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/am
sfonts/cm/cmbx8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsf
onts/cm/cmcsc10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsf
onts/cm/cmex10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfo
nts/cm/cmmi10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfon
ts/cm/cmmi5.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts
/cm/cmmi7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/c
m/cmmi8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/
cmmi9.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cm
r10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7
.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pf
b></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr9.pfb><
/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></
usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy5.pfb></us
r/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb></usr/
local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb></usr/l
ocal/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.pfb></usr/loc
al/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt10.pfb></usr/loca
l/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb>
Output written on paper.pdf (8 pages, 387544 bytes).
84i,9n,89p,818b,339s stack positions out of 10000i,1000n,20000p,200000b,200000s
</usr/local/texlive/2022/texmf-dist/fonts/type1/public/
amsfonts/cm/cmbx10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/a
msfonts/cm/cmbx8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/ams
fonts/cm/cmcsc10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/ams
fonts/cm/cmex10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsf
onts/cm/cmmi10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfo
nts/cm/cmmi5.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfont
s/cm/cmmi7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/
cm/cmmi8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm
/cmmi9.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/c
mr10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr
7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.p
fb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr9.pfb>
</usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb><
/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy5.pfb></u
sr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb></usr
/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb></usr/
local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.pfb></usr/lo
cal/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt10.pfb></usr/loc
al/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb></usr
/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msbm10.pfb>
Output written on paper.pdf (10 pages, 410946 bytes).
PDF statistics:
139 PDF objects out of 1000 (max. 8388607)
84 compressed objects within 1 object stream
150 PDF objects out of 1000 (max. 8388607)
91 compressed objects within 1 object stream
0 named destinations out of 1000 (max. 500000)
23 words of extra memory for PDF output out of 10000 (max. 10000000)
@@ -114,7 +114,188 @@ organised around a global nested-cycle decomposition of this kind.
\section{Background from nested tire decompositions}
We use the terminology and structural results of~\cite{bauerfeld-nested-tire-decompositions}. In particular, a level source induces levels in a plane maximal planar graph, the depth-$d$ inner-dual components determine tire graphs, and the resulting tire treads form a rooted tire tree $\mathcal{T}(G,S)$. For a tread $T$, we write $B_{\mathrm{out}}^{(T)}$ and $B_{\mathrm{in}}^{(T)}$ for its outer and inner boundary data, $O^{(T)}$ for its inner outerplanar graph, and $G_T$ for the triangulated disk on the descendant side of $B_{\mathrm{out}}^{(T)}$. The base paper also records the boundary-state transfer viewpoint for a single tire and the factorisation of global colouring questions through local tread colourings together with compatibility along parent-child interfaces.
We use the terminology and structural results of~\cite{bauerfeld-nested-tire-decompositions}. In particular, a level source induces levels in a plane maximal planar graph, the depth-$d$ inner-dual components determine tire graphs, and the resulting tire treads form a rooted tire tree $\mathcal{T}(G,S)$. For a tread $T$, we write $B_{\mathrm{out}}^{(T)}$ and $B_{\mathrm{in}}^{(T)}$ for its outer and inner boundary data, $O^{(T)}$ for its inner outerplanar graph, and $G_T$ for the triangulated disk on the descendant side of $B_{\mathrm{out}}^{(T)}$. The base paper also proves that each tire tread has an outerplanar inner dual and that global colouring questions factor through local tread colourings together with compatibility along parent-child interfaces.
\section{Single-tire colouring transfer}
\begin{theorem}[Tait correspondence: 4-colorings of a tire vs 3-edge-colorings of its inner dual]
\label{thm:tait-tire}
Let $T = (B_{\mathrm{out}}, O, E_{\mathrm{ann}})$ be a tire graph
(viewed as an annular triangulation of its tire tread $R$) and let
$\Gamma$ be its outerplanar inner dual, as supplied by
\cite{bauerfeld-nested-tire-decompositions}. Then
\[
\#\bigl\{\text{proper $4$-vertex-colorings of } T\bigr\} \big/ |S_4|
\;=\;
\#\bigl\{\text{proper $3$-edge-colorings of } \Gamma\bigr\} \big/ |S_3|.
\]
That is, the number of $4$-vertex-colorings of $T$ up to permutation
of the colour set $\{0, 1, 2, 3\}$ equals the number of
$3$-edge-colorings of $\Gamma$ up to permutation of the colour set
$\{1, 2, 3\}$.
\end{theorem}
\begin{proof}
The argument is the classical Tait correspondence
\cite{tait-original} adapted to the annular triangulation $T$.
Encode the four colours of a proper $4$-vertex-coloring $c \colon
V(T) \to \mathbb{Z}_2 \times \mathbb{Z}_2$. For each interior
annular edge $e$ of $T$ (whose two incident faces both lie in
$F_{\mathrm{ann}}$, contributing a $\Gamma$-edge $e^*$), set
\[
\chi^*(e^*) \;:=\; c(u) + c(v) \in \mathbb{Z}_2 \times \mathbb{Z}_2,
\qquad \text{where } u, v \text{ are the endpoints of } e.
\]
Since $c(u) \ne c(v)$, we have $\chi^*(e^*) \ne 00$, so $\chi^*$
takes values in $\{01, 10, 11\}$, which we identify with the
$3$-edge-coloring palette $\{1, 2, 3\}$.
\emph{Properness.} At each $\Gamma$-vertex $d_f$ corresponding to
an annular triangle $f = \{u, v, w\}$, the three incident
$\Gamma$-edges (one per cycle-edge of $f$) carry colours
$c(u) + c(v),\; c(v) + c(w),\; c(u) + c(w)$. These three elements
of $\mathbb{Z}_2 \times \mathbb{Z}_2$ sum to $0$ and are pairwise
distinct (their pairwise differences are
$c(u) - c(w),\; c(v) - c(u),\; c(w) - c(v)$, each nonzero), so
they form a permutation of $\{01, 10, 11\}$ --- a proper edge
colouring at $d_f$.
\emph{Surjectivity onto cosets.} Given a proper $3$-edge-coloring
$\chi^*$ of $\Gamma$, the equation $c(u) + c(v) = \chi^*(e^*)$
admits exactly $|\mathbb{Z}_2 \times \mathbb{Z}_2| = 4$ solutions
$c \colon V(T) \to \mathbb{Z}_2 \times \mathbb{Z}_2$ (a global
translation is the only freedom). Hence the map $c \mapsto
\chi^*$ is $4$-to-$1$.
\emph{Count.} Therefore $\#\{\text{4-colorings of } T\} = 4 \cdot
\#\{\text{3-edge-colorings of } \Gamma\}$. Dividing by $|S_4|
= 24$ on the left and $|S_3| = 6$ on the right (since $S_4$ acts
faithfully on the $4$-colorings and $S_3$ on the $3$-edge-colorings,
and the $4$-to-$1$ map respects the $S_4/S_3 \cong S_3$ quotient
via the natural surjection $S_4 \twoheadrightarrow S_3$) gives the
stated equality.
\end{proof}
\begin{remark}
\label{rem:count-general-outerplanar}
Theorem~\ref{thm:tait-tire} reduces the $4$-colouring count of a
tire to the $3$-edge-coloring count of its outerplanar inner dual
$\Gamma$. For the cycle case $\Gamma \cong C_{\mu+\nu}$ (the spoke-only
case described in \cite{bauerfeld-nested-tire-decompositions}), the cycle
chromatic polynomial at $3$ colours gives
$2^{\mu+\nu} + 2 (-1)^{\mu+\nu}$. For an inner dual with one or more
non-crossing chords, the count depends on the chord structure, not just
on the pair (number of vertices, number of chords): two outerplanar
graphs with the same number of vertices and number of chords can have
different proper
$3$-edge-coloring counts depending on how the chords are arranged
(nested, sequential, sharing vertices, etc.). Every such count
can nevertheless be computed in linear time by tree-decomposition
methods, since outerplanar graphs have treewidth at most $2$ and
the edge-chromatic polynomial admits a deletion--contraction
recursion that respects the cycle-plus-chord structure.
\end{remark}
\begin{definition}[Boundary-state chromatic transfer]
\label{def:boundary-state-transfer}
Let $T = (B_{\mathrm{out}}, O, E_{\mathrm{ann}})$ be a tire graph.
Choose a cut along one annular edge if both boundaries are
non-degenerate; in the degenerate case make no cut. The tread becomes
a triangulated disk $\widetilde R$. Let
\[
f_1, f_2, \ldots, f_m
\]
be any shelling order of the triangular faces of $\widetilde R$, i.e.\
an order in which each initial union
$\widetilde R_i := f_1 \cup \cdots \cup f_i$ is a disk. Such an order
is obtained by taking an outerplanar embedding of the inner dual
$\Gamma$ from \cite{bauerfeld-nested-tire-decompositions} and repeatedly
removing an outer-face ear.
For each $i$, let $A_i$ be the \emph{frontier}: the vertices of
$T$ incident to at least one processed face in $\widetilde R_i$ and to
at least one still-unprocessed constraint, where the unprocessed
constraints are the remaining annular faces together with any edge of
$O$ not yet tested by the transfer. A \emph{boundary state} on $A_i$
is a partition $\pi$ of $A_i$ into colour classes, subject to the
condition that adjacent vertices of $T[A_i]$ lie in distinct blocks.
We write $r(\pi)$ for the number of blocks of $\pi$.
\end{definition}
\begin{theorem}[Chromatic polynomial of a tire by frontier transfer]
\label{thm:tire-chromatic-polynomial-transfer}
For every tire graph $T$, the chromatic polynomial $P_T(q)$ is
computed by the following boundary-state dynamic program.
Initialize the table at $i=0$ with the empty frontier state of weight
$1$. When the next triangular face
$f_i = \{x,y,z\}$ is attached, pass from states on $A_{i-1}$ to states
on $A_i$ as follows.
\begin{enumerate}
\item[(1)] Introduce any vertices of $f_i$ not already present in
$A_{i-1}$, assigning each such vertex either to an existing
colour block not containing one of its already-coloured
neighbours, or to a new block.
\item[(2)] Reject every assignment in which two adjacent vertices of
the triangle $f_i$ lie in the same block. Also reject every
assignment in which an edge of $O$ whose two endpoints have
now both appeared for the first time as a tested pair has
both endpoints in the same block. Thus chords and bridges of
the inner outerplanar graph are enforced exactly when their
second endpoint becomes visible to the transfer.
\item[(3)] Delete from the state every vertex no longer incident to an
unprocessed constraint. If deleting a vertex removes the last
representative of its colour block from the frontier, multiply
that transition by $1$; the colour has already been chosen.
\item[(4)] If a new vertex is assigned to a new colour block while the
current frontier state has $r$ colour blocks, multiply that
transition by $q-r$. If several new colour blocks are created
in the same triangle, the factors are
$(q-r)(q-r-1)\cdots$ in the order of creation.
\end{enumerate}
After $f_m$ is processed, the frontier is empty. The single remaining
weight is $P_T(q)$.
\end{theorem}
\begin{proof}
The construction is the standard transfer for the chromatic polynomial,
specialized to the tire shelling. The frontier state records exactly
the equality pattern among colours that can still affect unprocessed
faces. Since colour names are irrelevant to the chromatic polynomial,
states are quotiented by the natural action of the symmetric group on
the colour set; a state with $r$ visible colour blocks can be extended
by a genuinely new colour in $q-r$ ways.
Each transition accounts for all proper colourings of the enlarged
processed disk $\widetilde R_i$ that restrict to the resulting frontier
state, and accounts for none that violate an edge of the newly attached
triangle or untested edge of $O$. Vertices removed from the frontier
have no future incident unprocessed constraint, so their actual colour
names can no longer influence compatibility and may be forgotten.
Induction on $i$ therefore shows
that the table after step $i$ is precisely the orbit-count generating
function for proper colourings of $\widetilde R_i$ by frontier state.
At $i=m$ no vertices remain active, so the accumulated weight counts all
proper colourings of $T$. Because the weights are polynomials in $q$,
this count is the full chromatic polynomial.
\end{proof}
\begin{remark}[Spoke-only transfer matrix]
\label{rem:spoke-only-chromatic-transfer}
In the spoke-only case with both boundaries simple cycles, the method
has a particularly small form. Cut the annulus along one spoke and
walk around the resulting strip. Each step adds one triangle sharing
an edge with the previous processed strip, so the frontier consists of
two or three consecutive boundary vertices. Up to colour permutation
there are only the possible equality patterns among those active
vertices, with adjacent vertices required to be distinct. The
chromatic polynomial is therefore the trace of a finite transfer matrix
whose entries are polynomials in $q$; the matrix depends only on the
local triangle type encountered while walking around the tread. Chords
or cut-vertices of $O$ enlarge the frontier only at the corresponding
outerplanar ears, and are handled by the same state rule of
Theorem~\ref{thm:tire-chromatic-polynomial-transfer}.
\end{remark}
\begin{remark}[Motivation for level-cycle restrictions]
\label{rem:level-cycle-motivation}