Pages that link to "Item:Q4063184"

The following pages link to Advances on the Hamiltonian Completion Problem (Q4063184):

Displaying 11 items.

• Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
• Path coverings of the vertices of a tree (Q1251231) (← links)
• Combinatorial algorithms on a class of graphs (Q1336626) (← links)
• A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
• On the Hamiltonian number of a plane graph (Q1630935) (← links)
• The Turán number for spanning linear forests (Q1720343) (← links)
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
• The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
• Hamiltonian completions of sparse random graphs (Q2576345) (← links)
• Atoll decompositions of graphs (Q4742825) (← links)
• Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447) (← links)