This page contains supplementary material for the paper R(K6 − e,K4) = 30 by David James, Elisha Kahan, and Erik Rauer.

​

Enumerated graphs are in Graph 6 format. For more information, see here.

• R(K_4,J_6,18).

• R(K_4,J_6,17).

​

Code:

• Enumeration algorithm one and two (Python code).

• Vertex extension algorithm (RUST code).

• SAT solver algorithm one and two.

• Gluing algorithm: The zip file contains code used for the gluing algorithm. The files labelled Method_R46_parXX.py were used to glue the case when the dual graph degree was XX. Miscellaneous code is found in the other files to create the pointed graphs and to construct gluing problems.

​