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

Browse Source

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>

...

This commit is contained in:

didericis

2026-05-14 00:27:11 -04:00

parent bd409585ba

commit f6144b98b5

6 changed files with 53 additions and 15 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/flip_symmetric_maximal_planar_graphs/paper.pdf

BIN

Binary file not shown.