Definition:Directed Hamilton Cycle Problem/Decision Version

From ProofWiki

< Definition:Directed Hamilton Cycle Problem

Jump to navigation Jump to search

Definition

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

Also see

Directed Hamilton Cycle Problem is NP-complete

Retrieved from "https://proofwiki.org/w/index.php?title=Definition:Directed_Hamilton_Cycle_Problem/Decision_Version&oldid=668688"

Definitions/Digraphs