k-path problem - P, NP or NPC?
If the path has to be simple reduce the HamiltonPath problem to this to show that's NP-complete, otherwise (not necessarily simple paths) take the $k$-th power of the adjacency matrix, whose entry corresponding to $u$ and $v$ not only contains whether there is such a path, but also the number of such paths.