Certified exhaustive verification of Lee's edge-graceful tree conjecture and the antimagic tree conjecture for all trees with at most 31 vertices: code and data
-
Updated
Oct 15, 2026 - Python
#
graph-labeling
Here are 4 public repositories matching this topic...
Graceful spider certificates, proof notes, and reproducible checks
-
Updated
Oct 10, 2026 - Lean
Research on distance-antimagic graph labelings: universal structure, finite-field constructions, and exhaustive verification through order 9.
reproducible-research computational-mathematics graph-theory finite-fields combinatorics cayley-graphs graph-labeling distance-antimagic
-
Updated
Aug 13, 2026
Companion code and data for “A finiteness theorem for geodesic Leech wheels”: labelings of W_5–W_13, exact-arithmetic verification of the bound n ≤ 40, and the spoke-frame search
-
Updated
Sep 3, 2026 - TeX
Add this topic to your repo
To associate your repository with the graph-labeling topic, visit your repo's landing page and select "manage topics."