Pages that link to "Item:Q902504"

The following pages link to A lower bound on the Hamiltonian path completion number of a line graph (Q902504):

Displaying 6 items.

• A lower bound for the optimal crossing-free Hamiltonian cycle problem (Q1091399) (← links)
• A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430) (← links)
• Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
• Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
• A bi-objective coordination setup problem in a two-stage production system (Q2482750) (← links)