The following pages link to (Q3694712):
Displayed 7 items.
- Independence and domination in polygon graphs (Q686246) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)