Write abstract and introduction around the constructive 4-coloring motivation

Browse Source

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>

...

This commit is contained in:

didericis

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

parent 9ff6c17bb7

commit 5675207ae0

4 changed files with 147 additions and 65 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

papers/even_level_graph_generators/paper.pdf

BIN

Binary file not shown.