Pages that link to "Item:Q672831"

The following pages link to The total interval number of a tree and the Hamiltonian completion number of its line graph (Q672831):

Displaying 12 items.

• Hydras: complexity on general graphs and a subclass of trees (Q507535) (← links)
• Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
• A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← 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)
• Total interval numbers of complete \(r\)-partite graphs (Q1613415) (← links)
• Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
• Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
• Hamiltonian completions of sparse random graphs (Q2576345) (← links)
• (Q3405197) (← links)
• The Total Interval Number of a Graph II: Trees and Complexity (Q4881297) (← links)
• THE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREES (Q5056629) (← links)