The binding number of a graph and its triangle

In this paper we prove the following conjecture of Woodall^[1]: if bind (G)3/2, thenG contains a triangle. Moreover we also prove that if bind (G)3/2, then each vertex is contained in a 4-cycle, each edge is contained in a 5-cycle whenV(G)11, and there exists a 6-cycle inG.