Program to determine whether for each matching of a given size in a cubic graph, there is a dominating cycle through that matching
Corrected year copyright
Added optimisation

The program now makes sure that the cycle can be closed. Since this sometimes creates a shortcut we now need to check that all matched vertices are in the cycle.
Added command line option to print the matchings
Fixed bug

Program was still looking for matchings of size 3
Removed old debugging code
Also print number of graph in input file
Added support for splitting the input in multiple parts and only outputting one part
Corrected typo in documentation
Program to translate the parent array format of Frank Ruskey's freetree to multicode
Program to generate all combinatorial embeddings of graphs