An optimized C++ program for verifying precoloring extensions of a graph. This was used in the paper with Sogol Jahanbekam and Brent Thomas on 7-coloring the square of subcubic planar graphs.
The Sage program and output from the paper on minimal DSF triples with Michael Barrus. In the output, triples are listed in human readable form as well as in graph6 format (denoted with ">...<"). Breaking pairs (H,H') are listed in graph6 format (denoted with "H>...<" and "Hp>...<").