Assertion: simple graph | /r/HasProperty | hamiltonian
Facets:
value: if
type: DEGREE
Source sentences:
text: A simple graph with n vertices ( n ≥ 3 ) is Hamiltonian if every vertex has degree n / 2 or greater.
text: A simple graph with n vertices (n ≥ 3) is Hamiltonian if, for every pair of non-adjacent vertices, the sum of their degrees is n or greater (see Ore's theorem).
text: A strongly connected simple directed graph with n vertices is Hamiltonian if every vertex has a full degree greater than or equal to n.
text: A strongly connected simple directed graph with n vertices is Hamiltonian if the sum of full degrees of every pair of distinct non-adjacent vertices is greater than or equal to 2n − 1 .