GRAPH REPRODUCTION FOR SECTIONS 4 AND 5

Tested environment
GAP 4.16.0, with loaded packages GAPDoc 1.6.11, SmallGrp 1.7.0,
PrimGrp 4.0.3 and TransGrp 3.6.5. No external graph package.
Optional independent verification: Python 3.12.14, standard library only.

Run these commands from this directory, with GAP in PATH:
    gap -q -b -A reproduce_graphs.g > gap_graphs_output.txt 2> gap_graphs_stderr.txt
    gap -q -b -A verify_certificate.g > gap_certificate_output.txt 2> gap_certificate_stderr.txt

Both stderr files must be empty. The stdout files must end respectively with
ALL GRAPH CHECKS PASSED and CERTIFICATE VERIFICATION PASSED. GAP may return
exit code zero after a language error, so do not rely on exit code alone.
The generated graph and certificate files are provided in this package.

To rebuild the independently computed JSON data and compare every adjacency:
    python3 independent_check.py > independent_output.txt
    python3 cross_check.py > cross_check_output.txt
The final messages must be ALL INDEPENDENT CHECKS PASSED and
ALL CROSS CHECKS PASSED.

No random generator, time limit, or node limit is used. Enumeration order,
exhaustiveness, colour symmetry, pruning and certificates are explained in
methods_graphs.txt. The raw output files are actual runs, not expected-output
mockups. Existing output data files are overwritten when rerunning commands.

The verifier checks that colour_certificate.g refers to exactly the graph in
clique_chromatic_graph.g. Every row of the flat proof table must be reached
once from root 1; every currently legal colour must appear exactly once among
its children. Dead leaves require all five colours to be forbidden.

Files
reproduce_graphs.g       groups, all overgroups, graph statistics, exact searches
verify_certificate.g     independent graph-only clique and colouring checker
*_graph.g               complete canonical labels and adjacency lists from GAP
colour_certificate.g    5-clique, complete 89-node UNSAT tree, six colour classes
gap_graphs_output.txt    actual GAP graph and search output
gap_certificate_output.txt actual independent GAP checker output
independent_check.py    separate multiplication-table implementation
*.json                  independent Python graph data and colouring proof
independent_output.txt  actual Python output
cross_check.py          compares every vertex label, adjacency and proof node
cross_check_output.txt  actual full cross-check output
methods_graphs.txt      methodological explanation and proposed manuscript text
