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

..

colored_pentagon_contractions

Move paper directories into papers/

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

flip_symmetric_maximal_planar_graphs

Add edge-deletion subgraph 4-colorability for a minimal counterexample

2026-05-14 00:27:11 -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

Complete n=28 census: 4 counterexamples among 1,204,737 min-deg-5 triangulations

2026-05-09 16:16:58 -04:00