Pages that link to "Item:Q1226105"

The following pages link to A linear algorithm for the Hamiltonian completion number of a tree (Q1226105):

Displaying 8 items.

• The total interval number of a tree and the Hamiltonian completion number of its line graph (Q672831) (← 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)
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
• Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
• The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
• Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447) (← links)
• Parameterizing path partitions (Q6664058) (← links)