Publication:4378637

zbMath0887.05029MaRDI QIDQ4378637

D. Pillone, Jayati Ghoshal, Renu C. Laskar

Publication date: 28 April 1998

zbMATH Keywords

game theory; kernel; tournament; domination; Grundy function; kernel perfect graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

91A43: Games involving graphs

05C20: Directed graphs (digraphs), tournaments

Related Items

On the domination polynomial of a digraph: a generation function approach, A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\), Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3, Directed domination in oriented graphs, A greedy partition lemma for directed domination, Decision-support with preference constraints, Domination in a digraph and in its reverse, The twin domination number in generalized de Bruijn digraphs, Dominating sets in directed graphs, Making choices with a binary relation: relative choice axioms and transitive closures, On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs, On the out-domination and in-domination numbers of a digraph, Distance domination of generalized de Bruijn and Kautz digraphs, Partitioning vertices into in- and out-dominating sets in digraphs, The domination number of wrapped butterfly digraphs, On the \(k\)-domination number of digraphs, Constructing the minimum dominating sets of generalized de Bruijn digraphs, Absorbant of generalized de Bruijn digraphs, Unions of digraphs which become kernel perfect, Twin domination in generalized Kautz digraphs, Domination in Digraphs, ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS