A Short Note On Graphs With Long Thomason Chains

DISCRETE MATHEMATICS（2022）

引用 0|浏览0

暂无评分

摘要

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 by approximately 0.003. (C) 2021 Elsevier B.V. All rights reserved.

查看译文

关键词

Thomason's algorithm, Hamiltonian cycle, Cubic graph, Smith's theorem

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要