\((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem

DOI10.1016/j.akcej.2019.03.002zbMath1439.05098OpenAlexW2921891785WikidataQ128234507 ScholiaQ128234507MaRDI QIDQ2176157

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

Publication date: 4 May 2020

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.03.002

zbMATH Keywords

kernelkernel by monochromatic paths\(H\)-kernel\((k, l)\)-kernel\(H\)-colored digraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

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

Cites Work

• \(H\)-kernels in infinite digraphs
• \(\Pi\)-kernels in digraphs
• On monochromatic paths in edge-coloured digraphs
• Kernels in edge-colored digraphs
• Kernels in weighted digraphs
• Restricted domination in arc-colored digraphs
• Kernels by monochromatic paths and the color-class digraph
• College Admissions and the Stability of Marriage
• On weighted kernels of two posets.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item