2-factors with k cycles in Hamiltonian graphs

@article{Bucic20202factorsWK,
  title={2-factors with k cycles in Hamiltonian graphs},
  author={Matija Buci'c and Erik Jahn and Alexey Pokrovskiy and Benny Sudakov},
  journal={J. Comb. Theory, Ser. B},
  year={2020},
  volume={144},
  pages={150-166}
}
1 Citations

Figures from this paper

References

SHOWING 1-10 OF 11 REFERENCES
Degree conditions for 2-factors
TLDR
It is proved that for k ≤ (n/4), Ore's classical condition for a graph to be hamiltonian implies that the graph contains a 2-factor with exactly k components.
Degree conditions for 2-factors
For any positive integer k, we investigate degree conditions implying that a graph G of order n contains a 2-factor with exactly k components (vertex disjoint cycles). In particular, we prove that
On 2-factors with k components
Robustness of graph properties
TLDR
Various measures that can be used to study robustness of graph properties are discussed, illustrating them with examples.
On extremal problems of graphs and generalized graphs
TLDR
It is proved that to everyl andr there is anε(l, r) so that forn>n0 everyr-graph ofn vertices andnr−ε( l, r), which means that all ther-tuples occur in ther-graph.
Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey
  • Hao Li
  • Mathematics
    Discret. Math.
  • 2013
Updating the hamiltonian problem - A survey
TLDR
This article contains some material on related topics such as traceable, hamiltonian-connected and pancyclic graphs and digraphs, as well as an extensive bibliography of papers in the area.
2-Factors in Hamiltonian Graphs
We show that every hamiltonian claw-free graph with a vertex x of degree d(x) ≥ 7 has a 2-factor consisting of exactly two cycles.
...
1
2
...