---
tag: 0HYV2NME07
kind: concept
name: Hamiltonian graph
msc: [05C45]
sources:
  - url: https://en.wikipedia.org/wiki/Hamiltonian_path
    locator: Definitions
---

## 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|090WPKFABX]] gives the precise definition.