Greedy Edge Colouring of Small Graphs

A NetworkX-based implementation of greedy edge-colouring for graphs in graph6 format. Using this implementation we investigate the average case performance on all non-isomorphic, connected simple graphs of at most nine vertices.

A Chromatic Number Program

A script for computing the chromatic number, based on the Tutte polynomial.