×

On even \([2,b]\)-factors in graphs. (English) Zbl 1026.05092

For each even integer \(b\geq 2\), the authors prove that a graph \(G\) of order \(n\) has an even \([2,b]\)-factor if \(G\) is 2-edge connected and each vertex of \(G\) has degree at least \(\max\{3,{2n\over b+2}\}\).

MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
PDFBibTeX XMLCite