Some sufficient conditions for the existence of kernels in infinite digraphs
From MaRDI portal
Publication:1025568
DOI10.1016/j.disc.2008.01.025zbMath1225.05110MaRDI QIDQ1025568
Mucuy-kak Guevara, Hortensia Galeana-Sánchez
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.025
kernel; infinite digraph; semikernel; kernel perfect digraph; semikernel modulo \(F\); critical kernel imperfect digraph
05C20: Directed graphs (digraphs), tournaments
Related Items
Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels, Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs, Kernels of digraphs with finitely many ends, On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On kernels and semikernels of digraphs
- Perfect graphs are kernel solvable
- A note on kernel-critical graphs
- On monochromatic paths in edge-coloured digraphs
- Kernels in pretransitive digraphs.
- Semikernels modulo \(F\) and kernels in digraphs
- Locally semicomplete digraphs: A generalization of tournaments
- A sufficient condition for a digraph to be kernel-perfect
- Graphes Noyau-Parfaits
- Quasi‐transitive digraphs
- On weakly ordered systems