Farber's topological complexity conjecture for graph configuration spaces

Let $G$ be a connected graph, and let $V_{\ge3}$ denote the set of vertices of $G$ of degree at least $3$. Assume that $|V_{\ge3}|\ge2$ and let $n\ge2|V_{\ge3}|$. Farber's conjecture. The topological complexity of the ordered configuration space of $n$ points on $G$ satisfies

$$\operatorname{TC}(\operatorname{Conf}_n(G))=2|V_{\ge3}|.$$

This conjecture predicts that, once the number of particles is sufficiently large, topological complexity is determined by the number of essential vertices of the graph. The supplied source does not state whether the conjecture has been resolved.