Pages that link to "Item:Q1939666"

The following pages link to The longest path problem is polynomial on cocomparability graphs (Q1939666):

Displaying 9 items.

• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• Nonempty intersection of longest paths in series-parallel graphs (Q729758) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
• A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs (Q4899036) (← links)
• Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
• Contracting to a longest path in H-free graphs (Q6065420) (← links)
• The longest path problem in odd-sized \(O\)-shaped grid graphs (Q6492015) (← links)