El-Zahar, Mohamed H. On circuits in graphs. (English) Zbl 0548.05037 Discrete Math. 50, 227-230 (1984). The author establishes the following: Let G be a simple graph on \(n_ 1+n_ 2\) vertices. If the minimum degree of G is \(([n_ 1/2]+[n_ 2/2]\) then G contains two independent circuits of lengths \(n_ 1\) and \(n_ 2\). Reviewer: D.P.Brown Cited in 2 ReviewsCited in 43 Documents MSC: 05C38 Paths and cycles Keywords:minimum degree; independent circuits PDFBibTeX XMLCite \textit{M. H. El-Zahar}, Discrete Math. 50, 227--230 (1984; Zbl 0548.05037) Full Text: DOI