Pages that link to "Item:Q1198484"

The following pages link to Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484):

Displaying 26 items.

• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
• Cyclability in graph classes (Q833007) (← links)
• Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
• Hamiltonian powers in threshold and arborescent comparability graphs (Q1301703) (← links)
• 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
• Weighted domination of cocomparability graphs (Q1382270) (← links)
• On the \(k\)-path partition of graphs. (Q1401225) (← links)
• Path partition for graphs with special blocks (Q1765521) (← links)
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
• Toughness, hamiltonicity and split graphs (Q1916113) (← links)
• HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
• Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• On the power of graph searching for cocomparability graphs (Q2801333) (← links)
• A Heuristic for Finding Compatible Differential Paths with Application to HAS-160 (Q2867170) (← links)
• The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
• The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
• Weighted domination on cocomparability graphs (Q6487953) (← links)
• On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time (Q6595513) (← links)
• The decycling number of a line graph (Q6646413) (← links)
• Parameterizing path partitions (Q6664058) (← links)