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 10 items.
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- Linear-time algorithms for counting independent sets in bipartite permutation graphs (Q1675914) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← 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)