Large Hamiltonian graphs with minimum degree n to the power 1 minus a small epsilon contain a 2-factor consisting of exactly k cycles.
Agarwal, Boris Aronov, J \' a nos Pach, Richard Pollack, and Micha Sharir
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
roles
method 1polarities
use method 1representative citing papers
A unified FPT framework reduces many crossing-number variants on surfaces to simplicial-complex embeddability, parameterized by genus and crossing bound, with linear or quadratic dependence.
citing papers explorer
-
On $2$-factors of Hamiltonian graphs
Large Hamiltonian graphs with minimum degree n to the power 1 minus a small epsilon contain a 2-factor consisting of exactly k cycles.
-
A Unified FPT Framework for Crossing Number Problems
A unified FPT framework reduces many crossing-number variants on surfaces to simplicial-complex embeddability, parameterized by genus and crossing bound, with linear or quadratic dependence.