The following pages link to (Q4378637):
Displayed 18 items.
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Decision-support with preference constraints (Q857275) (← links)
- Domination in a digraph and in its reverse (Q967348) (← links)
- The twin domination number in generalized de Bruijn digraphs (Q989508) (← links)
- Dominating sets in directed graphs (Q991901) (← links)
- Making choices with a binary relation: relative choice axioms and transitive closures (Q992691) (← links)
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Q1007577) (← links)
- On the out-domination and in-domination numbers of a digraph (Q1292825) (← links)
- Distance domination of generalized de Bruijn and Kautz digraphs (Q1692700) (← links)
- On the \(k\)-domination number of digraphs (Q2331578) (← links)
- Constructing the minimum dominating sets of generalized de Bruijn digraphs (Q2342640) (← links)
- Absorbant of generalized de Bruijn digraphs (Q2380030) (← links)
- Unions of digraphs which become kernel perfect (Q2420420) (← links)
- Twin domination in generalized Kautz digraphs (Q3014589) (← links)
- ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS (Q3575376) (← links)