Covering cycles and \(k\)-term degree sums

DOI10.1007/BF01261324zbMath0857.05058MaRDI QIDQ2563515

Zbigniew Lonc, Mekkia Kouider

Publication date: 16 December 1996

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

cyclesminimum degreeconjecture of Enomoto, Kaneko and Tuza

Mathematics Subject Classification ID

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

Related Items (7)

Cycle partitions of regular graphs ⋮ Stability for vertex cycle covers ⋮ Coverings of the vertices of a graph by small cycles ⋮ On resilience of connectivity in the evolution of random graphs ⋮ Covering cycles in sparse graphs ⋮ On the path partition of graphs ⋮ Covering the vertices of a graph with cycles of bounded length

Cites Work

• Note on Hamilton Circuits
• Covering vertices by cycles
• Degree Sums and Covering Cycles
• Some Theorems on Abstract Graphs

This page was built for publication: Covering cycles and \(k\)-term degree sums