Pages that link to "Item:Q2379947"
From MaRDI portal
The following pages link to Linear structure of bipartite permutation graphs and the longest path problem (Q2379947):
Displayed 6 items.
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs (Q3078397) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)