Pages that link to "Item:Q1939666"
From MaRDI portal
The following pages link to The longest path problem is polynomial on cocomparability graphs (Q1939666):
Displaying 6 items.
- 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)
- 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)