On a conjecture concerning 4-coloring of graphs
with one crossing
This page contains computer assisted parts of the paper
On a conjecture concerning 4-coloring of graphs
with one crossing.
A preliminary version of the paper can be downloaded here
or from arXiv.
Here, you can download the technical generated things here
- anc.tar.gz ... 240K, programs and small files
- md5g.28 ... 29M, output of a program on 28 vertices including statistics summary at the end
- graphs_by_order_20.pkl ... 12M, 22,353 graphs of order up to 20
- graphs_by_order_21.pkl ... 44M, 81,158 graphs of order up to 21
- graphs_by_order_22.pkl ... 167M, 296,023 graphs of order up to 22
- graphs_by_order_23.pkl ... 641M, 1,081,761 graphs of order up to 23
- graphs_by_order_24.pkl ... 2.4G, 3,965,863 graphs of order up to 24
- graphs_by_order_25.pkl ... 9.2G, 14,576,016 graphs of order up to 25
- bernard25.log .. 467K, log of test on 25 vertices with statistics ad the beginning
It is also possible to download programs needed to perform the calculation
from arXiv.
Dependencies