scientific article; zbMATH DE number 842876

MaRDI QIDQ4862336zbMATH OpenFDO

Authors Charles Riedesel, Jitender Deogun

Publication date 5 June 1996

zbMATH Keywords

Hamiltonian pathpermutation graphsperfect graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1308950
• Publication:3470494
• Construction of Hamiltonian paths in graphs of permutation polyhedra
• scientific article; zbMATH DE number 4091550
• scientific article; zbMATH DE number 3906532
• Hamiltonian paths and hamiltonian connectivity in graphs
• scientific article; zbMATH DE number 4106894
• Hamilton paths in graphs whose vertices are graphs
• Hamiltonian paths in Cayley graphs

Cited in

(5)

• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
• The maximum clique problem for permutation Hamming graphs
• Construction of Hamiltonian paths in graphs of permutation polyhedra

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