David Eppstein – Publications

On the treewidth of Hanoi graphs.
D. Eppstein, D. Frishberg, and W. Maxwell.
arXiv:2005.00179.
Proc. 10th Int. Conf. Fun with Algorithms (FUN 2021).
Leibniz International Proceedings in Informatics (LIPIcs) 157, 2020, pp. 13:1–13:21, doi:10.4230/LIPIcs.FUN.2021.13.
Theor. Comput. Sci. 906: 1–17, 2022, doi:10.1016/j.tcs.2021.12.014.

The \(n\)-disc \(p\)-peg Hanoi graphs have treewidth within a polynomial factor of \(n^{p-1}\). In a follow-up paper, "On the expansion of Hanoi graphs", we eliminated the polynomial factor.