Degree conditions for the partition of a graph into cycles, edges and isolated vertices

DOI10.1016/j.disc.2007.12.056zbMath1191.05049OpenAlexW1966570355MaRDI QIDQ1025545

Shinya Fujita

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.056

zbMATH Keywords

vertex-disjoint cyclesdegree conditionspartition of a graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Degree conditions on copies of forests in graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Disjoint cycles and \(2\)-factors with Fan-type condition in a graph ⋮ Ramsey-type results for path covers and path partitions

Cites Work

• New sufficient conditions for cycles in graphs
• Weak cycle partition involving degree sum conditions
• Partition of a graph into cycles and degenerated cycles
• Note on Hamilton Circuits
• Independence trees and Hamilton cycles
• Degree conditions for 2-factors
• Unnamed Item

This page was built for publication: Degree conditions for the partition of a graph into cycles, edges and isolated vertices