Circular flow number

Home CAAGT Authors Jan Goedgebeur Davide Mattiolo Giuseppe Mazzuoccolo

Circular flow number Compute-cfn computes the circular flow number of a (bridgeless) cubic graph. The circular flow number of a graph G is the least real number r such that G admits a circular nowhere-zero r-flow. The program was used in the following manuscripts. J. Goedgebeur, D. Mattiolo and G. Mazzuoccolo, A unified approach to construct snarks with circular flow number 5, 27 pages, 2018. Preprint: (arXiv). J. Goedgebeur, D. Mattiolo and G. Mazzuoccolo, An algorithm and new bounds for the circular flow number of snarks, 20 pages, 2019. Preprint: (arXiv). The generator can be downloaded here and a short manual can be found here. Compute-cfn is released under the GNU General Public License (GPL) and has been tested on Linux and Mac OS X. Installation instructions: Compile using the command "make". Remark: the inputgraphs are read from stdin in multicode format and the graphs and the graphs with the desired circular flow number are written to stdout in the same format. The statistics of the circular flow number of snarks (including downloadable lists) can be found at the House of Graphs. Don't hesitate to contact us at jan.goedgebeur[at]ugent.be if you have any further questions or suggestions.