I am confused by the two conclusions in this paper ([DOI link behind paywall at Springerlink](https://link.springer.com/content/pdf/10.1007/s10878-019-00461-7.pdf)).


It shows that the equitable tree-coloring problem is $W[1]$-hard when parameterized
by treewidth.


However, it also shows that the equitable tree-coloring problem is polynomial solvable in the class
of graphs of bounded treewidth.


Does this mean $W[1]=FPT$?



$W[1]$-hard and FPT about the equitable tree-coloring problem
No. Fix $k \in \mathbb{N}$ and let $G$ be an $n$-vertex graph of treewidth at most $k$. If you analyze their polynomial-time algorithm that decides if $G$ has an equitable tree-colouring, you'll notice that the degree of the polynomial depends on $k$. For example, in the proof of Theorem 11, there is a bound of the form $O(n B^2(k+1) \lceil n/r \rceil^{2c(k+1)})$, where $r$ and $c$ are constants and $B(k+1)$ is the $(k+1)$-th Bell number. An FPT algorithm must run in time at most $f(k)n^d$, where $d$ is a constant independent of $k$. Thus, their algorithm is not an FPT algorithm.


Of course, it is widely believed (but not proved) that FPT $\neq$ W[1].


