Hamiltonian graph
Summary
A Hamiltonian graph is a graph that has a cycle through all of its vertices. There is no simple test for this property, but degree conditions give sufficient criteria. The node Hamiltonian graph gives the precise definition.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/Hamiltonian_path, Definitions
What links here
Definitions
- Hamiltonian graph 090WPKFABX