An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles

DOI10.1007/978-3-319-94830-0_8zbMATH Open1416.05158OpenAlexW2892974786MaRDI QIDQ2315580FDOQ2315580

Authors: Theodore Molla, Derrek Yager, H. A. Kierstead, Alexandr Kostochka 

Publication date: 25 July 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-94830-0_8

Recommendations

• An Ore-type condition for the existence of two disjoint cycles
• An improved bound for disjoint directed cycles
• The hidden algorithm of Ore's theorem on Hamiltonian cycles
• Disjoint Cycles: Integrality Gap, Hardness, and Approximation
• scientific article; zbMATH DE number 482046
• Parameterized Approximability of the Disjoint Cycle Problem
• Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
• A Note on Vertex-Disjoint Cycles
• On the problem of finding disjoint cycles and dicycles in a digraph
• A conjecture of Verstraëte on vertex-disjoint cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (3)

• Antiparallel \(d\)-stable traces and a stronger version of ore problem
• The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles
• On the Corrádi-Hajnal theorem and a question of Dirac

This page was built for publication: An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles

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