Partition of a graph into cycles and degenerated cycles
From MaRDI portal
Publication:1422422
DOI10.1016/S0012-365X(03)00300-5zbMath1031.05103OpenAlexW1997653782MaRDI QIDQ1422422
Publication date: 14 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00300-5
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles ⋮ Partition of a graph into cycles and vertices ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Weak cycle partition involving degree sum conditions ⋮ Degree conditions for the partition of a graph into cycles, edges and isolated vertices ⋮ Ramsey-type results for path covers and path partitions ⋮ Recent Results on Disjoint Cycles in Graphs
Cites Work
This page was built for publication: Partition of a graph into cycles and degenerated cycles
