Hamiltonicity below Dirac's condition

DOI10.1007/978-3-030-30786-8_3MaRDI QIDQ2301533zbMATH OpenOpenAlexFDO

Authors Bart M. P. Jansen, László Kozma, Jesper Nederlof

Publication date 24 February 2020

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

zbMATH Keywords

fixed-parameter tractabilityHamiltonicitykernelization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On one extension of Dirac's theorem on Hamiltonicity
• Hamilton cycles in hypergraphs below the Dirac threshold
• Robust Hamiltonicity of Dirac graphs
• Hamiltonian cycles in Dirac graphs
• Dirac's theorem for random graphs

Cited in

(10)

• On one extension of Dirac's theorem on Hamiltonicity
• On the minimum cycle cover problem on graphs with bounded co-degeneracy
• Detours in directed graphs
• Hamiltonicity below Dirac's condition
• Turán’s Theorem Through Algorithmic Lens
• Long directed detours: reduction to 2-disjoint paths
• Approximating long cycle above Dirac's guarantee
• Longest cycle above Erdős-Gallai bound
• Longest cycle above Erdős-Gallai bound
• A graph width perspective on partially ordered Hamiltonian paths and cycles ii: vertex and edge deletion numbers

This page was built for publication: Hamiltonicity below Dirac's condition

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