A simple proof of a theorem of Jung

Abstract

Jung's theorem states that if G is a 1-tough graph on n⩾11 vertices such that d( x) + d( y)⩾ n −4 for all distinct nonadjacent vertices x, y, then G is hamiltonian. We give a simple proof of this theorem for graphs with 16 or more vertices.