Computational complexity of the Hamiltonian cycle problem in dense hypergraphs

DOI10.1007/978-3-642-12200-2_57MaRDI QIDQ3557058zbMATH OpenOpenAlexFDO

Authors Andrzej Ruciński, Edyta Szymańska, Marek Karpinski

Publication date 27 April 2010

Published in LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12200-2_57

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 6829379
• Hamilton cycles in hypergraphs below the Dirac threshold
• On Hamiltonian cycles in hypergraphs with dense link graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• The Complexity of Perfect Matching Problems on Dense Hypergraphs

Cited in

(9)

• Complexity of the hamiltonian cycle in regular graph problem
• Hamilton cycles in hypergraphs below the Dirac threshold
• Constructing dense graphs with unique Hamiltonian cycles
• The NPO-completeness of the longest Hamiltonian cycle problem
• The complexity of vertex coloring problems in uniform hypergraphs with high degree
• scientific article; zbMATH DE number 6829379 (Why is no real title available?)
• A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
• Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
• On the Keevash-Knox-Mycroft conjecture

This page was built for publication: Computational complexity of the Hamiltonian cycle problem in dense hypergraphs

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