Finding long paths and cycles in sparse Hamiltonian graphs

DOI10.1145/335305.335368zbMath1296.05114OpenAlexW2084421815MaRDI QIDQ3192021

Carlos Subi, Tomás Feder

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335368

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Spanning spiders and light-splitting switches ⋮ Well-mixing vertices and almost expanders ⋮ Algorithms for long paths in graphs ⋮ Algorithm for two disjoint long paths in 2-connected graphs

This page was built for publication: Finding long paths and cycles in sparse Hamiltonian graphs