Assertion: simple graph | /r/HasAspect | hamiltonian path
Facets:
Source sentences:
text: A simple graph with n vertices has a Hamiltonian path if, for every non-adjacent vertex pairs the sum of their degrees and their shortest path length is greater than n.