Assertion: graph's cycle | /r/HasProperty | hamiltonian
Facets:
Source sentences:
text: A graph that contains a Hamiltonian cycle is called a Hamiltonian graph.
text: A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian path that is a cycle.
text: Line graphs may have other Hamiltonian cycles that do not correspond to Euler tours, and in particular the line graph L(G) of every Hamiltonian graph G is itself Hamiltonian, regardless of whether the graph G is Eulerian.
text: A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian path that is a cycle.
text: A connected graph $G$ is called Hamiltonian graph if there is a cycle which includes every vertex of $G$ and the cycle is called Hamiltonian cycle.
text: Such a cycle is known as a Hamiltonian cycle, and determining whether it exists is NP-complete.
text: A 4-connected planar graph has a Hamiltonian cycle.
text: A Hamiltonian cycle, Hamiltonian circuit, vertex tour or graph cycle is a cycle that visits each vertex exactly once.