Covering cycles and k-term degree sums

DOI10.1007/BF01261324MaRDI QIDQ2563515zbMATH OpenFDO

Authors Mekkia Kouider, Zbigniew Lonc

Publication date 16 December 1996

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01261324

zbMATH Keywords

conjecture of Enomoto, Kaneko and Tuzacyclesminimum degree

Mathematics Subject Classification ID

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

Recommendations

• Degree Sums and Covering Cycles
• A degree sum condition for graphs to be covered by two cycles
• Stability for vertex cycle covers
• Degree sums and graphs that are not covered by two cycles

Cites work

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

Cited in

(13)

• Covering the vertices of a graph with cycles of bounded length
• Stability for vertex cycle covers
• On resilience of connectivity in the evolution of random graphs
• On DRC‐covering of K_n by cycles
• Degree Sums and Covering Cycles
• Partial Degree Conditions and Cycle Coverings
• Cycle partitions of regular graphs
• Covering cycles in sparse graphs
• On the path partition of graphs
• Cycle partitions in dense regular digraphs and oriented graphs
• Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
• An Ore-type condition for 2-connected \([2,k]\)-factors in 2-connected graphs
• Coverings of the vertices of a graph by small cycles

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

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