Shared files for working with cubic graphs
Program to check whether a snark is odd 2-factored.
Adapted algorithm for edge connectivity to also handle multigraphs
Program to calculate essential edge connectivity of graphs in multicode format
Allow the graphs to be filtered based on their invariant value
Information about number of read and written graphs
Removed unused variable
Also enable filter of graphs with invariant values less than or greater than a specified value