Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
Computational Complexity
2025-10-13 v2 Data Structures and Algorithms
Abstract
We prove that Hamiltonian Path and Hamiltonian Cycle are NP-hard on graphs of linear mim-width 26, even when a linear order of the input graph with mim-width 26 is provided together with input. This fills a gap left by a broken proof of the para-NP-hardness of Hamiltonicity problems parameterized by mim-width.
Cite
@article{arxiv.2507.00612,
title = {Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard},
author = {Benjamin Bergougnoux and Lars Jaffke},
journal= {arXiv preprint arXiv:2507.00612},
year = {2025}
}
Comments
13 pages, 6 figures