2-factors with \(k\) cycles in Hamiltonian graphs

DOI10.1016/j.jctb.2020.02.002zbMath1443.05106arXiv1905.09729OpenAlexW3011167694MaRDI QIDQ777484

Matija Bucić, Alexey Pokrovskiy, Erik Jahn, Benjamin Sudakov

Publication date: 7 July 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian cycles2-factorsDirac thresholds

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (1)

Disjoint cycles and \(2\)-factors with Fan-type condition in a graph

Cites Work

• Unnamed Item
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs
• On 2-factors with \(k\) components
• On extremal problems of graphs and generalized graphs
• A note on 2-factors with two components
• Updating the hamiltonian problem—A survey
• Degree conditions for 2-factors
• Robustness of graph properties
• Some Theorems on Abstract Graphs

This page was built for publication: 2-factors with \(k\) cycles in Hamiltonian graphs