scientific article; zbMATH DE number 1439412

MaRDI QIDQ4949786zbMATH OpenFDO

Authors A. Ray Chaudhuri

Publication date 8 July 2001

zbMATH Keywords

interval graphHamiltonian path completion number

Mathematics Subject Classification ID

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

Recommendations

• A lower bound on the Hamiltonian path completion number of a line graph
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• Local search algorithms for finding the Hamiltonian completion number of line graphs
• A simple algorithm to find Hamiltonian cycles in proper interval graphs

Cited in

(4)

• Local search algorithms for finding the Hamiltonian completion number of line graphs
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• Evolutionary operators for the Hamiltonian completion problem
• A lower bound on the Hamiltonian path completion number of a line graph

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