scientific article; zbMATH DE number 1439412

zbMATH Open0964.05036MaRDI QIDQ4949786FDOQ4949786

Authors: A. Ray Chaudhuri 

Publication date: 8 July 2001

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

interval graphHamiltonian path completion number

Mathematics Subject Classification ID

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

Cited In (4)

• 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
• Local search algorithms for finding the Hamiltonian completion number of line graphs

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)