METHODOLOGICAL DOCUMENTATION FOR SECTIONS 4 AND 5

Verified execution status: reproduce_graphs.g and verify_certificate.g were executed in separate GAP processes. The environment was GAP 4.16.0, with GAPDoc 1.6.11, SmallGrp 1.7.0, PrimGrp 4.0.3 and TransGrp 3.6.5 actually loaded. GAP was launched with gap -q -b -A to prevent optional packages from loading automatically. All assertions passed, and both stderr files were empty. The complete outputs are provided in gap_graphs_output.txt and gap_certificate_output.txt. independent_check.py was also executed in Python 3.12.14 without external packages. It reproduces all statistics and checks the identity, inverses and associativity of the entire multiplication table, generation of the full group, the normal forms and the defining relations.

The three groups are reconstructed from the displayed presentations, with the images of the named generators retained explicitly under an isomorphism to a permutation group. The internal generators returned by SmallGroup are not assumed to coincide with the symbols in the manuscript. SmallGrp is used only to verify the three identifiers [16,3], [64,8], [64,68]. The remaining computations use GAP core and do not require GRAPE, Digraphs, IO, SAT or other packages.

Indexing. Elements are ordered lexicographically by the exponent tuples of their normal forms, with the first exponent varying slowest and the last varying fastest. Indices are 1-based. For the chromatic-number example, f1^e1 f2^e2 f3^e3 f4^e4 f5^e5 f6^e6 has index 1+32e1+16e2+8e3+4e4+2e5+e6, with e_i in {0,1}. For the diameter 3 example, a^i b^j z^k has index 1+4i+2j+k. For the diameter 4 example, x^i y^j c^k d^l has index 1+16i+8j+2k+l. The normal forms are checked for the required cardinality and pairwise distinctness. Each *_graph.g file provides all exponent tuples and the complete adjacency list.

Overgroups and exhaustiveness. All n(n-1)/2 pairs of indices i<j are enumerated. The program constructs L=<g_i,g_j> and retains the pair exactly when H is contained in L. Subgroups are deduplicated by comparing their complete element sets, expressed in the fixed indices. Since H is noncyclic, every 2-generated overgroup of H has a generating pair of distinct elements and therefore appears in this enumeration. No heuristic filters or subgroup pruning are applied. For each L, the output records its order, the first generating pair encountered and its complete element list. Section 4.2 is also checked by directly comparing the eight subgroups displayed in its table with the complete enumeration.

Statistics. The adjacency lists are constructed directly from the defining condition H <= <x,y>, without using the expected statistics. The isolated vertices and degree distributions are then compared with the manuscript. Breadth-first search from every non-isolated vertex verifies connectivity, diameter, distance profiles, the distance distribution of unordered pairs and the periphery. The number of edges is also checked using Lemma 1.1: for p=2, it is (3/16) sum_L |L|^2.

Cliques. The displayed clique has indices [41,45,33,9,12]. All its 10 adjacencies are checked directly. All cliques are enumerated in strictly increasing vertex order: after choosing v, only candidates greater than v and adjacent to every previously chosen vertex are retained. This procedure visits each clique exactly once. No pruning based on an estimated bound is used. The counts for sizes 0,1,2,3,4,5,6 are 1,64,843,4425,8600,5248,0. The size 1 count includes the five isolated vertices of Gamma; for Delta, this count would be 59. The independent verifier repeats the enumeration using a separate implementation and checks every extension.

Colouring. The clique [41,45,33,9,12] is precoloured with colours 1,2,3,4,5 in that order. This removes only the symmetry arising from permutations of the five colours: any possible 5-colouring can be relabelled to satisfy this assignment. At each node, an uncoloured vertex is chosen by maximum saturation (the number of distinct colours present among its neighbours), then maximum degree and finally minimum index. All legal colours from 1 to 5 are tried in increasing order. A colour is excluded only when it is already used by a neighbour. No timeouts, node limits, heuristic pruning, random ordering or additional assumptions are used. Isolated vertices are excluded because they can always be assigned an arbitrary colour.

The node count is the number of calls to the recursive procedure after the clique has been precoloured, including the root and dead leaves. With the indexing and ordering specified above, the count is exactly 89, with 4 dead leaves. The search records the complete tree in colour_certificate.g, and an independent record is provided in colour_certificate.json. In the GAP file, the certificate is a table of 89 rows, with root 1. A row is [v, children]; each child is [colour, child_row_index]. The independent JSON file instead retains the nested structure [v, children], with children [colour, subtree]. The GAP verifier checks that every row is reached exactly once and that the certificate graph coincides with the graph reconstructed in clique_chromatic_graph.g. The separate verifier neither assumes DSATUR nor relies on the count of 89: it recomputes the set of legal colours, requires all and only those colours to appear exactly once among the children, and accepts a leaf only when all five colours are forbidden. It verifies that v is still uncoloured and applies and reverses each assignment. Induction on the tree therefore rules out every possible completion. The initial clique precolouring extends this impossibility to all 5-colourings.

The manuscript's 6-colouring is checked exactly: six disjoint classes of sizes 5,4,17,13,16,4 cover the 59 non-isolated vertices, and each class has no internal edges. Their indices are supplied in the certificate. Isolated vertices may be assigned to any class. The displayed induced cycle is [33,9,4,49,25]; both its five consecutive edges and the absence of its five chords are checked.

RESULTS VERIFIED BOTH IN GAP AND INDEPENDENTLY IN PYTHON
Diameter 3 example: |G|=16, 13 non-isolated vertices, 51 edges, 2 overgroups of orders 4 and 16, degree counts 2:1 / 8:10 / 10:2, pair-distance counts 51,25,2, diameter 3.
Diameter 4 example: |G|=64, 61 non-isolated vertices, 1203 edges, 8 overgroups with order counts 4:1 / 8:4 / 32:2 / 64:1, degree counts 2:1 / 16:6 / 32:4 / 34:2 / 36:16 / 48:32, pair-distance counts 1203,585,38,4, diameter 4.
Clique and chromatic-number example: |G|=64, 59 non-isolated vertices, 843 edges, 11 overgroups with order counts 4:1 / 8:6 / 32:4, degree counts 10:1 / 16:8 / 18:1 / 20:16 / 26:1 / 32:24 / 52:8, pair-distance counts 843,852,16, diameter 3, omega=5, chi=6.

