Assertion: graph's path | /r/HasProperty | simple spanning cycle
Facets:
value: particularly
type: DEGREE
Source sentences:
text: Hamiltonian A Hamiltonian path or Hamiltonian cycle is a simple spanning path or simple spanning cycle: it covers all of the vertices in the graph exactly once.
text: A path is a particularly simple example of a tree, and in fact the paths are exactly the trees in which no vertex has degree 3 or more.