\(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
From MaRDI portal
Publication:334121
DOI10.1016/j.akcej.2016.06.005zbMath1348.05088OpenAlexW2467393867MaRDI QIDQ334121
Hortensia Galeana-Sánchez, Rocío Sánchez-López
Publication date: 31 October 2016
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.2016.06.005
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- \(H\)-kernels in infinite digraphs
- On monochromatic paths in m-coloured tournaments
- On monochromatic paths in edge-coloured digraphs
- Kernels in edge-colored digraphs
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- 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
This page was built for publication: \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph