The following pages link to (Q4818795):
Displaying 11 items.
- Directed domination in oriented graphs (Q423913) (← links)
- Efficient total domination in digraphs (Q450576) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Regular tournaments with minimum split domination number and cycle extendability (Q2089539) (← links)
- Orientable domination in product-like graphs (Q2109114) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Extremal digraphs for an upper bound on the Roman domination number (Q2331577) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Domination in Digraphs (Q3384119) (← links)
- The watchman's walk problem on directed graphs (Q5000299) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
