The following pages link to (Q4390698):
Displaying 7 items.
- Finding a chain graph in a bipartite permutation graph (Q284350) (← links)
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Double-threshold permutation graphs (Q2159387) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- Linear-time recognition of double-threshold graphs (Q5970798) (← links)