Jul 2026
NP-Hardness of Connected Components Reconfiguration under Component Jumping on Caterpillar Graphs
It is proved that \CCRCJ~on path graphs is NP-hard even on caterpillar graphs, which is a very restricted subclass of trees and chordal graphs minimally above path graphs, thereby resolving Nakahata's open problem on chordal graphs under multiset size constraints.
Naoki Kitamura, Seitaro Kawaguchi, Yuya Terashima et al.
· arXiv.org · 0 citations