Short manual of Balanced2ColourabilityStrongWormald
---------------------------------------------------

Author: Jan Goedgebeur (jan.goedgebeur@ugent.be)
In collaboration with Marién Abreu, Domenico Labbate and Giuseppe Mazzuoccolo

Balanced2ColourabilityStrongWormald is a program which constructs all bisections with given properties for the inputgraphs and can be used to test if a graph has a Strong Wormald Colouring.

This program has been tested on Linux and Mac OS X.


Installation
------------

The latest version of Balanced2ColourabilityStrongWormald can be obtained from http://caagt.ugent.be/bisections/

- Compile Balanced2ColourabilityStrongWormald using the command "make".


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