scientific article; zbMATH DE number 2077653

MaRDI QIDQ4472695zbMATH OpenFDO

Authors Rao Li, Yusheng Li

Publication date 1 July 2004

zbMATH Keywords

Hamiltonian cyclepolynomial time algorithm

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Searching for \(f\)-Hamiltonian circuits
• The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs
• A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• On Hamiltonicity of regular graphs with bounded second neighborhoods

Cited in

(4)

• Searching for \(f\)-Hamiltonian circuits
• Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
• Tough graphs and Hamiltonian circuits.
• The NPO-completeness of the longest Hamiltonian cycle problem

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 Q4472695)