On circuits through five edges Original Research Article

Let L be a set of five independent edges in a 5-connected graph G. This paper proves that G has a circuit containing the edges of L if and only if G - L is connected. This is a specific case of a conjecture of Lovász and Woodall.