Cycles of length 2 modulo 3 in graphs (Q1197035)

One theorem is shown: If a graph \(G\) with minimum degree \((\delta)\) at least 3 has no cycle of length \(2\pmod 3\), then \(G\) contains either an induced \(K_ 4\) or \(K_{3,3}\). A consequence is an earlier result by Dean et al. that a 2-connected graph \(G\) with \(\delta(G)\geq 3\) has a cycle of length \(2\pmod 3\) unless \(G\) is a \(K_ 4\) or \(K_{3,n}(n\geq 3)\).