The following pages link to (Q3679238):
Displaying 4 items.
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
