Reconfiguring Subgraphs with Extra Resources
This work focuses on the setting where the subgraph is specified by its set of edges, and proves two generalizations: for any fixed $k$ at least one, reconfiguring connected graphs with pathwidth at most $k$ is $\textsf{NP}$-hard, and for any fixed $k$ at least two, reconfiguring graphs with pathwidth at most $k$ is al...