Assertion: graph's cycle | /r/AtLocation | graph
Facets:
value: always
type: DEGREE
Source sentences:
text: Much research has been published concerning classes of graphs that can be guaranteed to contain Hamiltonian cycles; one example is Ore's theorem that a Hamiltonian cycle can always be found in a graph for which every non-adjacent pair of vertices have degrees summing to at least the total number of vertices in the graph.