Finding full immersions is fixed-parameter tractable in labeled tour graphs

Hadas Barabash, Jim Geelen, Rose McCarty +2

We give an $O_H(n^5)$-time algorithm to test whether an $n$-vertex labeled tour graph has a full immersion isomorphic to a labeled tour graph $H$. A labeled tour graph is a connect…