didericis 646cf9d12f Add connected tire clusters with two-cluster-per-vertex proposition ...

Define a connected tire cluster (union of same-depth tires joined by
shared vertices, transitive closure), prove same-depth tires meet only
in vertices, and prove every vertex lies in at most two clusters (one at
each of two consecutive depths) -- the bounded coarsening of the
unbounded per-vertex tire count.

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

2026-06-17 01:03:37 -04:00

..

colored_edge_flip_classes

…

colored_pentagon_contractions

…

coloring_nested_tire_dual_graphs

Move tire coloring transfer to restrictions paper

2026-06-08 15:09:58 -04:00

even_level_graph_generators

…

face_monochromatic_pairs

…

heawood_restrictions_on_nested_tire_graph_duals

Add connected tire clusters with two-cluster-per-vertex proposition

2026-06-17 01:03:37 -04:00

iterated_reduction_in_reduced_dual

…

level_resolutions_of_maximal_planar_graphs

…

level_switching

…

medial_tire_cuts

Draw source-dual cut on a valid straight-line embedding

2026-06-16 03:59:22 -04:00

medial_tire_decompositions_of_plane_triangulations

Handle compound medial tires in cut labelling

2026-06-15 21:46:56 -04:00

nested_tire_decompositions_of_plane_triangulations

Add medial tire decomposition paper

2026-06-08 15:34:53 -04:00

plane_depth

rename: coloring_nested_tire_graphs → coloring_nested_tire_dual_graphs

2026-05-27 00:44:09 -04:00

plane_depth_sequencing

split: extract foundational depth material into new plane_depth paper

2026-05-26 13:49:44 -04:00

plane_diamond_coloring

…

three_color_restrictions_nested_tire_graphs

Move tire coloring transfer to restrictions paper

2026-06-08 15:09:58 -04:00