didericis b7777cb45e Add plane diamond coloring paper with 2-colorability theorem ...

Defines distance partition (BFS layers from a chosen vertex) and the diamond
scaffold of a maximal planar graph (G with all same-level edges removed),
then proves the diamond scaffold is 2-colorable by parity of level.

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

2026-05-09 11:52:07 -04:00

..

colored_pentagon_contractions

Move paper directories into papers/

2026-04-21 21:19:16 -04:00

kempe_proof_fixed

Move paper directories into papers/

2026-04-21 21:19:16 -04:00

kempe_style_search_for_smaller_contradiction

Move paper directories into papers/

2026-04-21 21:19:16 -04:00

plane_depth_sequencing

Simplify d=0 case in outerplanar lemma proof

2026-04-25 05:22:25 -04:00

plane_diamond_coloring

Add plane diamond coloring paper with 2-colorability theorem

2026-05-09 11:52:07 -04:00