Short manual of ConjectureWormald ---------------------------------- Author: Jan Goedgebeur (jan.goedgebeur@ugent.be) In collaboration with Marién Abreu, Domenico Labbate and Giuseppe Mazzuoccolo ConjectureWormald is a program which constructs all 2-edge colourings with given properties for the inputgraphs and can be used to test a conjecture of Wormald. This program has been tested on Linux and Mac OS X. Installation ------------ The latest version of ConjectureWormald can be obtained from http://caagt.ugent.be/bisections/ - Download, extract and configure nauty from http://users.cecs.anu.edu.au/~bdm/nauty/ (ConjectureWormald requires nauty 2.5 or a more recent version). - Compile the nauty libraries using: "make nautyW1.a" - Copy the following files to the ConjectureWormald directory: naurng.h naututil.h nauty.h nautyW1.a - Compile ConjectureWormald using the command "make". Usage ----- An overview of all options can also be found by executing "./conjecture_wormald -h". Usage: ./conjecture_wormald [options] Valid options are: strong: Search for Strong Wormald Colourings. thomassen: Test if the graphs can be decomposed in two 4-linear forests. The inputgraphs are read from stdin in and written to stdout and are encoded in multicode format (see Appendix A). Don't hesitate to contact me at jan.goedgebeur@ugent.be if you have any further questions or suggestions. Changelog --------- 2017-05-18: First release. Appendix A: definition of the multicode format ---------------------------------------------- This code is binary. The first entry is the number of vertices. Vertices are numbered 1,...,n. For each vertex x there is a list of neighbours with higher labels than x, followed by a zero. The last list is always empty (there are no neighbours of n with a higher number than n), therefore the last "list" is not followed by a zero. After the last byte the next graph follows. The codelength of a graph in multicode is number of vertices + number of edges. More information about this format + a program to translate multicode to adjacency lists can be found at: http://hog.grinvin.org/Formats.action#multicode