Facts
Citation
URLhttps://en.wikipedia.org/wiki/Dirac%27s_theorem_on_Hamiltonian_cycles
Sources
Dirac's theorem on Hamiltonian cycles, Wikipedia
Lead sectionQuote, Lead section
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once.
Claims Backed By This Source (6 claims)
This source backs 6 claims across the atlas. As facts: 4 well-attested. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Theorems, 5 claims: 3 well-attested, 2 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.