Algorithmic extensions of Dirac's theorem

DOI10.1137/1.9781611977073.20MaRDI QIDQ6575092zbMATH OpenFDO

Authors Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.20

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Long directed detours: reduction to 2-disjoint paths
• Fixed-parameter tractability of maximum colored path and beyond
• Approximating long cycle above Dirac's guarantee
• Longest cycle above Erdős-Gallai bound
• Stability in Bondy's theorem on paths and cycles
• Longest cycle above Erdős-Gallai bound

This page was built for publication: Algorithmic extensions of Dirac's theorem

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