W[1]-hard problems on bounded degree graphs
Ball and Trap I remains $W[1]$-hard when restricted to binary trees.

Theorem 5 states:


  Theorem 5. Ball and Trap I remains $W[1]$-hard restricted to binary trees,
  the maximum number of traps per vertex is one per color, and balls are placed
  on neither leaves nor parents of leaves.