Claims

../

1998_01_01_bondy_vince: Every graph with at most two vertices of degree below three, other than K1 and K2, has two cycles whose lengths differ by one or two; so a 4-chromatic graph has consecutive cycle lengths at most two apart, whatever its girth.

---