\(H\)-kernels in infinite digraphs

DOI10.1007/S00373-012-1150-6zbMath1268.05090OpenAlexW1979104723MaRDI QIDQ354449

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

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1150-6

zbMATH Keywords

kernelcolor-class digraph\(H\)-kernelkernel by monochromatic path

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) Infinite graphs (05C63)

Related Items (4)

Richardson's theorem in \(H\)-coloured digraphs ⋮ \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph ⋮ \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem ⋮ \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs

Cites Work

• Kernels in infinite digraphs
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Kernels in edge-colored digraphs
• A counterexample to a conjecture on edge-coloured tournaments
• Absorbing sets in arc-coloured tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Perfect graphs, kernels, and cores of cooperative games
• Restricted domination in arc-colored digraphs
• Reachability problems in edge-colored digraphs
• Kernels by monochromatic paths and the color-class digraph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(H\)-kernels in infinite digraphs