Corpus ID: 119714351

A short note on graphs with long Thomason's chains

@article{Brianski2019ASN,
  title={A short note on graphs with long Thomason's chains},
  author={Marcin Bria'nski and Adam Szady},
  journal={arXiv: Combinatorics},
  year={2019}
}
  • Marcin Bria'nski, Adam Szady
  • Published 2019
  • Mathematics
  • arXiv: Combinatorics
  • 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. 

    Figures from this paper.

    References