Chvátal's Theorem

Let a graph have graph vertices with vertex degrees . If for every we have either or , then the graph is Hamiltonian.

See also

Hamiltonian Graph

Explore with Wolfram|Alpha

More things to try:

References

Chvátal, V. "On Hamilton's Ideals." J. Combin. Th. 12, 163-168, 1972.

Referenced on Wolfram|Alpha

Chvátal's Theorem

Cite this as:

Weisstein, Eric W. "Chvátal's Theorem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/ChvatalsTheorem.html

Subject classifications