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

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

Publication date: 25 July 2019

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

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (1)

• Antiparallel \(d\)-stable traces and a stronger version of ore problem

Recommendations

• Title not available (Why is that?) 👍 👎
• On the problem of finding disjoint cycles and dicycles in a digraph 👍 👎
• A Conjecture of Verstraëte on Vertex-Disjoint Cycles 👍 👎
• Disjoint Cycles: Integrality Gap, Hardness, and Approximation 👍 👎
• A Note on Vertex-Disjoint Cycles 👍 👎
• Parameterized Approximability of the Disjoint Cycle Problem 👍 👎
• Strengthening Theorems of Dirac and Erdős on Disjoint Cycles 👍 👎
• An Ore-type condition for the existence of two disjoint cycles 👍 👎
• The hidden algorithm of Ore's theorem on Hamiltonian cycles 👍 👎
• An improved bound for disjoint directed cycles 👍 👎

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)