Id: palomar/PALOMAR-2026-11-12-000012 Url: https://github.com/jtraverso/vizing-adjacency-lemmas/tree/ef2c05cff377f965f9274b578b96133bf42b52af Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-12-000012-v1.json Repo: https://github.com/jtraverso/vizing-adjacency-lemmas Tags: math.CO, msc:05C15 Score: 0 Title: Vizing's adjacency lemma, the multifan lemma and Kierstead's lemma, as a standalone module Trust: high Domain: math.CO Source: palomar Authors: Juan Pablo Traverso Gianini Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-12 Formalized: true Formalizes: title=Critical graphs with given chromatic class identifier= relationship=formalizes Formalizes: title=On the chromatic index of multigraphs without large triangles identifier=doi:10.1016/0095-8956(84)90022-4 relationship=formalizes Formalizes: title=Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-12-000012 A thin wrapper that exposes, with Mathlib definitions only, the basic recolouring lemmas of edge-colouring theory proved inside PALOMAR-2026-11-04-000009 (overfull-critical-graphs). vizing_adjacency_lemma (Vizing 1965): if G is of class two (its line graph is not Δ(G)-colourable) and G − xy is Δ(G)-edge-colourable, then x has at least Δ − d(y) + 1 neighbours of degree Δ other than y. critical_two_maxDegree_neighbours: every vertex of a Δ-critical graph has at least two neighbours of degree Δ. multifan_lemma (Stiebitz–Scheide–Toft–Favrholdt, Theorem 2.1): for a Δ(G)-colouring of G − x y₀ of a…