A short note on graphs with long Thomason's chains [article]

Marcin Briański, Adam Szady
2020 arXiv   pre-print
We present a family of 3-connected cubic planar Hamiltonian graphs with an exponential number of steps required by Thomason's algorithm. The base of the exponent is approximately 1.1812..., which exceeds previous results in the area.
arXiv:1903.02515v2 fatcat:tupngaeddvaf5kjmpqxozgvzfq