Richardson's theorem in \(H\)-coloured digraphs
From MaRDI portal
Publication:292262
DOI10.1007/s00373-015-1609-3zbMath1338.05101OpenAlexW2108989537MaRDI QIDQ292262
Rocío Sánchez-López, Hortensia Galeana-Sánchez
Publication date: 13 June 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1609-3
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs, \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs, Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(H\)-kernels in infinite digraphs
- On monochromatic paths in edge-coloured digraphs
- Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
- Kernels in edge-colored digraphs
- Perfect graphs, kernels, and cores of cooperative games
- Restricted domination in arc-colored digraphs
- Reachability problems in edge-colored digraphs
- Solutions of irreflexive relations
- Kernels by monochromatic paths and the color-class digraph