\(\Pi\)-kernels in digraphs
From MaRDI portal
Publication:897229
DOI10.1007/s00373-014-1499-9zbMath1327.05135OpenAlexW1987146070MaRDI QIDQ897229
Juan José Montellano-Ballesteros, Hortensia Galeana-Sánchez
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1499-9
Related Items (3)
\((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem ⋮ A Richardson's theorem version for \(\Pi\)-kernels ⋮ Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels
Cites Work
- On monochromatic paths in m-coloured tournaments
- On monochromatic paths in edge-coloured digraphs
- Kernels in edge-colored digraphs
- Absorbing sets in arc-coloured tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- Perfect graphs, kernels, and cores of cooperative games
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(\Pi\)-kernels in digraphs
