# Is there an efficient algorithm to determine the parity of the longest path in a graph?

Finding the longest path in a graph is intractable problem. Th decision version is $NP$-complete. However, Given a graph, Is there an efficient algorithm to determine the parity of the longest path in a graph?

The algorithm should output YES if the length of the longest path is even otherwise the output is NO. Also, What is the complexity if we restrict the input to cubic graphs?

-
cross posted on TCS stack exchange. cstheory.stackexchange.com/questions/8216/… –  Mohammad Al-Turkistany Sep 13 '11 at 16:44

Seems to me there's an easy reduction from the problem of hamiltonian path: Give a graph G you want to determine if it contains a hamiltonian path or not, simply add a disjoint path of length equal to the length of the expected hamiltonian path minus 1. Now check the parity and see if it equals that of the path you added or not.

-