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.
Further reading
- Web https://en.wikipedia.org/wiki/Hamiltonian_path, Definitions
About this page
| Tag | 0HYV2NME07 |
|---|---|
| URI | m2://0HYV2NME07 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C45 |
| Specializes | Graph |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.