Definition:Directed Hamilton Cycle Problem/Decision Version

Definition

 * Given a directed graph $G$ with $n$ vertices, to determine whether $G$ has a Hamilton cycle.

Also see

 * Directed Hamilton Cycle Problem is NP-complete