Graphs with a Cycle of Length Divisible by Three

In this paper, we will prove that every graph G with minimum degree δ(G) ≥ 3 contains a cycle of length divisible by three. This was conjectured to be true by Barefoot, Clark, Douthett, and Entringer.