Definition:Directed Hamilton Cycle Problem

From ProofWiki
Jump to: navigation, search

Definition

There are two versions of the Directed Hamilton Cycle Problem.


Function Version

Given a directed graph $G$ with $n$ vertices, to find a Hamilton cycle in $G$.


Decision Version

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


Also see