Kernels in directed graphs: A poison game
From MaRDI portal
Publication:1801706
DOI10.1016/0012-365X(93)90496-GzbMath0773.05052OpenAlexW1972345768MaRDI QIDQ1801706
Publication date: 20 June 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90496-g
2-person games (91A05) Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20)
Related Items
Kernels of digraphs with finitely many ends, On the subtle nature of a simple logic of the hide and seek game, H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs., Infinite kernel perfect digraphs, A simple logic of the hide and seek game, Perfect graphs, kernels, and cores of cooperative games, Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes, On the existence of \((k,l)\)-kernels in infinite digraphs: a survey, Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels, On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Cites Work
