Super edge-magic labelings of all trees on 18 to 22 vertices (certificates)

Explicit super edge-magic labelings for every unlabeled tree on 18, 19, 20, 21 and 22 vertices (123867, 317955, 823065, 2144505 and 5623756 trees; OEIS A000055). Each line gives a tree’s edges and a vertex labeling onto {1..n} whose n-1 edge sums are consecutive integers. Together with Lee and Shan’s computer verification up to 17 vertices (Gallian, Dynamic Survey of Graph Labeling DS6, 28th ed., Section 5.2), this shows every tree on at most 22 vertices is super edge-magic. Coverage of every order was checked by two independent checkers, one of which regenerates every tree, and by a three-skeptic panel. Produced as a V3R1T4S (github.com/elder-plinius/V3R1T4S) contribution. Files: sem-trees-18-20-certificates.tar.xz (orders 18 to 20, unchanged from v1, sha256 390d1698ff6e9563ed2e41a645cff865a05ab6b5427ece910e5bdda6ed82cc8b); cert_n21.txt.xz (sha256 88af13db7d462dba3551df35eecaf294d12bb1838d7ebb2a9b6552496c1fb356); cert_n22.txt.xz (sha256 58933786e80b94272f3a5da81b88a3ed8dafcfe37f9e4f8045b1af2c247b2b8d).