14 citations · 19 across the 3 of their papers we have counts for
1 paper · 1 filter
Marcin Briański, Adam Szady
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 $…