A Size Bound for Hamilton Cycles

Abstract

Every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le {\delta }^2+\delta -1$. The result is sharp.

3 pages

Cited by in corpus (1)

• A Size Upper Bound for Dominating Cycles