Pages that link to "Item:Q2379947"

The following pages link to Linear structure of bipartite permutation graphs and the longest path problem (Q2379947):

Displaying 19 items.

• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• Bipartite permutation graphs with application to the minimum buffer size problem (Q678867) (← 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)
• Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
• A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← 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)
• A linear algorithms for the two paths problem on permutation graphs (Q4882588) (← links)
• Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
• Labelled well-quasi-order for permutation classes (Q5051473) (← links)
• Tropical paths in vertex-colored graphs (Q5918388) (← links)
• Path eccentricity of graphs (Q6162021) (← links)