Assertion: graph's path | /r/HasProperty | every vertex
Facets:
value: exactly once
type: TEMPORAL
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: In general, this ordering is not unique; a DAG has a unique topological ordering if and only if it has a directed path containing all the vertices, in which case the ordering is the same as the order in which the vertices appear in the path.
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).