A minimum degree result for disjoint cycles and forests in graphs

DOI10.1007/PL00009831zbMath0921.05051OpenAlexW1991452738MaRDI QIDQ1297728

Gerald W. Schuster

Publication date: 14 September 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009831

zbMATH Keywords

cyclespackingminimum degreeforest

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Subdivisions of graphs: A generalization of paths and cycles ⋮ Disjoint cycles with chords in graphs ⋮ Degree condition for subdivisions of unicyclic graphs ⋮ On pseudo 2-factors

This page was built for publication: A minimum degree result for disjoint cycles and forests in graphs