We give a historical account of the parametrized results for the k-Path problem: given a graph G and a positive integer k, is there a simple path in G of length k. Throughout the years several ingen
