A short note on graphs with long Thomason's chains
Combinatorics
2021-09-28 v2
Abstract
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 , which exceeds previous results in the area.
Cite
@article{arxiv.1903.02515,
title = {A short note on graphs with long Thomason's chains},
author = {Marcin Briański and Adam Szady},
journal= {arXiv preprint arXiv:1903.02515},
year = {2021}
}
Comments
9 pages, 13 figures