Kernels of digraphs with finitely many ends

DOI10.1016/j.disc.2018.10.026zbMath1400.05101OpenAlexW2900577867WikidataQ128950985 ScholiaQ128950985MaRDI QIDQ1625806

Michał Walicki

Publication date: 29 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/11250/2720810

zbMATH Keywords

infinite digraphdigraph kernelend of a digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Unnamed Item
• Expressive power of digraph solvability
• Kernels in digraphs that are not kernel perfect
• Kernels in infinite digraphs
• Some sufficient conditions for the existence of kernels in infinite digraphs
• On directed graphs with an independent covering set
• Ends in digraphs
• Kernels in directed graphs: A poison game
• Solutions of irreflexive relations
• RESOLVING INFINITARY PARADOXES

This page was built for publication: Kernels of digraphs with finitely many ends