didericis 5675207ae0 Write abstract and introduction around the constructive 4-coloring motivation ...

Frame the paper's purpose: ask whether two constructive families of
4-colorable triangulations -- bridge-derived level graphs (parity
2-coloring) and intertwining trees (two trees, disjoint color pairs) --
suffice to generate every maximal planar graph on n vertices. An
affirmative answer would be a constructive proof of the four color theorem
for triangulations. State the duality bridge to Tait/Holton-McKay and the
n=21 confirmation.

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

2026-05-22 11:34:07 -04:00

1.0 MiB

Raw History

View Raw