Poison game for semikernels of arbitrary digraphs

DOI10.7151/DMGT.2562MaRDI QIDQ6950204zbMATH OpenFDO

Authors Michał Walicki

Publication date 31 July 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2562

zbMATH Keywords

infinite digraphskernelssemikernels

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Infinite graphs (05C63) Games involving graphs (91A43)

Cites work

• A parity digraph has a kernel
• scientific article; zbMATH DE number 4095497 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Infinite kernel perfect digraphs
• Kernels in directed graphs: A poison game
• Kernels of digraphs with finitely many ends
• On kernels and semikernels of digraphs
• Patterns of paradox
• Perfect graphs, kernels, and cores of cooperative games
• Recent problems and results about kernels in directed graphs
• Resolving infinitary paradoxes
• Solutions of irreflexive relations
• The strong perfect graph theorem
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes

This page was built for publication: Poison game for semikernels of arbitrary digraphs

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