Partition of a graph into cycles and degenerated cycles

DOI10.1016/S0012-365X(03)00300-5zbMATH Open1031.05103OpenAlexW1997653782MaRDI QIDQ1422422FDOQ1422422

Authors: Hikoe Enomoto, Hao Li 

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

Recommendations

• scientific article; zbMATH DE number 2094820
• scientific article; zbMATH DE number 2101287
• scientific article; zbMATH DE number 2186975
• Degree conditions for the partition of a graph into cycles, edges and isolated vertices
• Partition of a graph into cycles and vertices

zbMATH Keywords

CyclePartitionDegenerated cycle

Mathematics Subject Classification ID

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

Cites Work

• On the existence of disjoint cycles in a graph
• Degree conditions for 2-factors

Cited In (14)

• Cycle partitions of regular graphs
• Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
• Title not available (Why is that?)
• Partitioning a graph into two square-cycles
• Partition of a graph into cycles and vertices
• Weak cycle partition involving degree sum conditions
• Degree conditions for the partition of a graph into cycles, edges and isolated vertices
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Recent Results on Disjoint Cycles in Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
• Ramsey-type results for path covers and path partitions
• Title not available (Why is that?)

This page was built for publication: Partition of a graph into cycles and degenerated cycles

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