Corpus ID: 226281837

Algorithmic Extensions of Dirac's Theorem

@article{Fomin2020AlgorithmicEO,
  title={Algorithmic Extensions of Dirac's Theorem},
  author={F. Fomin and P. Golovach and Danil Sagunov and K. Simonov},
  journal={ArXiv},
  year={2020},
  volume={abs/2011.03619}
}
  • F. Fomin, P. Golovach, +1 author K. Simonov
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every $n$-vertex $2$-connected graph $G$ with minimum vertex degree $\delta\geq 2$ contains a cycle with at least $\min\{2\delta,n\}$ vertices. In particular, if $\delta\geq n/2$, then $G$ is Hamiltonian. The proof of Dirac's theorem is constructive, and it yields an algorithm computing the corresponding cycle in polynomial time. The combinatorial bound of Dirac's theorem is tight in the… CONTINUE READING

    References

    SHOWING 1-10 OF 43 REFERENCES
    Hamiltonicity below Dirac's condition
    • 2
    • PDF
    A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture
    • B. Li, Bo Ning
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 2021
    • 1
    • PDF
    A randomized algorithm for long directed cycle
    • M. Zehavi
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 2016
    • 10
    • PDF
    Determinant Sums for Undirected Hamiltonicity
    • 97
    A method in graph theory
    • 350
    An Improved Algorithm for Finding Cycles Through Elements
    • 18
    Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey
    • Hao Li
    • Mathematics, Computer Science
    • Discret. Math.
    • 2013
    • 35
    Parameterized Traveling Salesman Problem: Beating the Average
    • 8
    Long Cycles in Digraphs
    • 63
    Faster deterministic parameterized algorithm for k-Path
    • Dekel Tsur
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2019
    • 8
    • PDF