Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels

DOI10.1016/j.akcej.2019.12.020zbMath1468.05095OpenAlexW3048048423MaRDI QIDQ4956220

Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.12.020

zbMATH Keywords

kernelkernel by monochromatic paths\((\mathscr{A} , \mathscr{B} )\)-kernel\(\mathscr{R}\)-kernelH-kernel

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels in infinite digraphs
• \(\Pi\)-kernels in digraphs
• Some sufficient conditions for the existence of kernels in infinite digraphs
• On monochromatic paths in edge-coloured digraphs
• Kernels in edge-colored digraphs
• Kernels in directed graphs: A poison game
• \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• Restricted domination in arc-colored digraphs
• Reachability problems in edge-colored digraphs
• Solutions of irreflexive relations

This page was built for publication: Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels