scientific article; zbMATH DE number 6829379

DOI10.4230/LIPICS.STACS.2016.38MaRDI QIDQ4601890zbMATH OpenFDO

Authors Frederik Garbe, Richard Mycroft

Publication date 24 January 2018

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2016.38

zbMATH Keywords

graph algorithmsHamilton cycleshypergraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) 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

• Computational complexity of the Hamiltonian cycle problem in dense hypergraphs
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• On extremal hypergraphs for Hamiltonian cycles
• On extremal hypergraphs for Hamiltonian cycles
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Complexity of the hamiltonian cycle in regular graph problem
• An extremal problem for cycles in hamiltonian graphs
• On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
• On Hamiltonian cycles in hypergraphs with dense link graphs
• On hyper-Hamiltonicity in graphs

Cited in

(7)

• Complexity of the hamiltonian cycle in regular graph problem
• Hamilton cycles in hypergraphs below the Dirac threshold
• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
• The NPO-completeness of the longest Hamiltonian cycle problem
• Computational complexity of the Hamiltonian cycle problem in dense hypergraphs
• scientific article; zbMATH DE number 1249657 (Why is no real title available?)
• Tight Euler tours in uniform hypergraphs -- computational aspects

This page was built for publication:

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