Packing Chromatic Number of Distance Graphs
This is dedicated to the manuscript Packing Chromatic Number of Distance Graphs
by Jan Ekstein, Premek Holub and Bernard Lidicky.
With the assistance of a computer, we prove several lower bounds
for the packing chromatic number of distance graphs.
The programs used for proving the bounds and their outputs
can be downloaded on this page.
Please refer to the manuscript for all the terminology.
The program is written in C++ and compiles with gcc. It is meant to be run under
Linux - we provide shell scripts for simplifying the execution.
You may want to use parallel
to speed up the execution.