×

On circuits in graphs. (English) Zbl 0548.05037

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

MSC:

05C38 Paths and cycles
PDFBibTeX XMLCite
Full Text: DOI