Cycle partitions of regular graphs

DOI10.1017/S0963548320000553OpenAlexW3114569623MaRDI QIDQ5886097

Shoham Letzter, Vytautas Gruslys

Publication date: 30 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.00851

zbMATH Keywords

2-factorregular graphHamilton cyclecycle cover

Mathematics Subject Classification ID

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

Related Items (2)

On the path partition of graphs ⋮ Random perfect matchings in regular graphs

Cites Work

• Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
• Monochromatic cycle partitions of graphs with large minimum degree
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• An approximate version of Sumner's universal tournament conjecture
• Hamiltonian degree sequences in digraphs
• Longest cycles in regular graphs
• Dominating cycles in regular 3-connected graphs
• Hamilton cycles in regular 3-connected graphs
• Hamilton cycles in 2-connected regular bipartite graphs
• Hamilton cycles in sparse robustly expanding digraphs
• On vertex-disjoint paths in regular graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Covering cycles and \(k\)-term degree sums
• The robust component structure of dense regular graphs and applications
• A proof of Sumner's universal tournament conjecture for large tournaments
• A class of Hamiltonian regular graphs
• Hamiltonian Cycles in Regular Graphs
• Covering vertices by cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycle partitions of regular graphs