On the treewidth of Hanoi graphs

DOI10.1016/j.tcs.2021.12.014OpenAlexW4205140992MaRDI QIDQ2077387

William Maxwell, David Eppstein, Daniel Frishberg

Publication date: 21 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.00179

zbMATH Keywords

haventreewidthtensor productKneser graphHanoi graphvertex expansiongraph separators

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A tour of general Hanoi graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on the Kronecker product of graphs
• Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
• Sparsity. Graphs, structures, and algorithms
• A survey and classification of Sierpiński-type graphs
• Hamming dimension of a graph-the case of Sierpiński graphs
• Lower bounds for treewidth of product graphs
• Kneser's conjecture, chromatic number, and homotopy
• Parameterized leaf power recognition via embedding into graph products
• A new short proof for the Kruskal-Katona theorem
• Forbidden minors characterization of partial 3-trees
• Graph searching and a min-max theorem for tree-width
• The fourth tower of Hanoi
• On the diameter of Kneser graphs
• Fixed-Parameter Tractability of Treewidth and Pathwidth
• The Tower of Hanoi – Myths and Maths
• Coloring and Counting on the Tower of Hanoi Graphs
• The Kronecker Product of Graphs
• Local Expansion of Symmetrical Graphs
• Fractality and the small-world effect in Sierpinski graphs

This page was built for publication: On the treewidth of Hanoi graphs