A simple question:What would be the complexity of finding whether a hampath of length $k$ exists in a graph with $n$ vertexes where $k < n$?Would this be in NP-complete or just NP?
complexity of finding the hampath of length $k$ in a graph with $n$ vertexes where $k < n$
complexity theory;graph theory