Assertion: graph | /r/HasAspect | path
Facets:
Source sentences:
text: Like the graph 1 above, if a graph has a path that includes every vertex exactly once, while ending at the initial vertex, the graph is Hamiltonian (is a Hamiltonian graph).
text: Like the graph 2 above, if a graph has a path that includes every vertex exactly once, but ending at another vertex than the starting one, then the graph is semi-Hamiltonian (is a semi-Hamiltonian graph).