A short note on graphs with long Thomason's chains

13 Jun 2020 Briański Marcin Szady Adam

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...

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS