The following pages link to (Q5463350):
Displayed 8 items.
- Finding clubs in graph classes (Q400518) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)