The following theorems can be regarded as directed versions: Ghouila-Houiri (1960) A strongly connected simple directed graph with n vertices is Hamiltonian if every vertex has a full degree greater than or equal to n.
Următoarele teoreme pot fi considerate ca fiind versiuni ale acesteia: Ghouila-Houiri (1960) Un graf orientat simplu tare conex cu n noduri este hamiltonian dacă orice nod are gradul total mai mare sau egal cu n.