A Size Bound for Hamilton CyclesAbstractEvery graph of size q (the number of edges) and minimum degree δ is hamiltonian if qδ2+δ-1. The result is sharp.0Discussion (0)Sign in to join the discussion.Loading comments…