A minimum degree result for disjoint cycles and forests in graphs

DOI10.1007/PL00009831zbMATH Open0921.05051OpenAlexW1991452738MaRDI QIDQ1297728FDOQ1297728

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2104713
• An extension of the Corrádi-Hajnal theorem
• On the maximum number of independent cycles in a graph
• Disjoint cycles and \(2\)-factors with Fan-type condition in a graph

zbMATH Keywords

minimum degreecyclespackingforest

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)

Cited In (8)

• Minimum degree and minimum number of edge-disjoint trees
• Title not available (Why is that?)
• Degree condition for subdivisions of unicyclic graphs
• On pseudo 2-factors
• Disjoint cycles with chords in graphs
• Subforests of bipartite digraphs---the minimum degree condition
• A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
• Subdivisions of graphs: A generalization of paths and cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297728)