Bisections

Home CAAGT Authors Marién Abreu Jan Goedgebeur Domenico Labbate Giuseppe Mazzuoccolo

Bisections The algorithms used in the programs listed on this page are described in: M. Abreu, J. Goedgebeur, D. Labbate and G. Mazzuoccolo, Colourings of cubic graphs inducing isomorphic monochromatic subgraphs, Journal of Graph Theory, 92(4):415-444, 2019. The programs are released under the GNU General Public License (GPL) and have been tested on Linux and Mac OS X. 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. Balanced2ColourabilityStrongWormald can be downloaded here and a short manual can be found here. Installation instructions: Compile using the command "make". ConjectureWormald is a program which constructs all 2-edge colourings with given properties for cubic inputgraphs and can be used to test a conjecture of Wormald. ConjectureWormald can be downloaded here and a short manual can be found here. Installation instructions: Download, extract and configure nauty (GenHypohamiltonian 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 using the command "make". Don't hesitate to contact us at jan.goedgebeur[at]ugent.be if you have any further questions or suggestions.