Kernels in directed graphs: A poison game

DOI10.1016/0012-365X(93)90496-GMaRDI QIDQ1801706zbMATH OpenOpenAlexFDO

Authors Pierre Duchet, Henri Meyniel

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

zbMATH Keywords

directed graphlocal kernelpoison gametwo player game

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
• Combinatorial game theory foundations applied to digraph kernels
• Perfect graphs are kernel solvable
• scientific article; zbMATH DE number 3865312
• Perfect graphs, kernels, and cores of cooperative games

Cites work

• Graphes Noyau-Parfaits
• scientific article; zbMATH DE number 4095497 (Why is no real title available?)
• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• On kernels and semikernels of digraphs

Cited in

(24)

• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• Combinatorial game theory foundations applied to digraph kernels
• Games, kernels, and antitone operations
• Kernels of digraphs with finitely many ends
• On a game in directed graphs.
• On the subtle nature of a simple logic of the hide and seek game
• Infinite kernel perfect digraphs
• Perfect graphs, kernels, and cores of cooperative games
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints
• scientific article; zbMATH DE number 3865312 (Why is no real title available?)
• scientific article; zbMATH DE number 1124608 (Why is no real title available?)
• Extensions of Richardson's theorem for infinite digraphs and \((\mathscr{A} , \mathscr{B} )\)-kernels
• H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
• On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
• A simple logic of the hide and seek game
• Counting kernels in directed graphs with arbitrary orientations
• The modal logics of the poison game
• Graph games and logic design
• Poison game for semikernels of arbitrary digraphs
• Local stability in kidney exchange programs
• The theorem of Richardson and its generalizations: a survey
• Reasoning under uncertainty in the game of cops and robbers

This page was built for publication: Kernels in directed graphs: A poison game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801706)