Kernel perfect and critical kernel imperfect digraphs structure
From MaRDI portal
Recommendations
- Semikernels modulo F in digraphs
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
- New extensions of kernel perfect digraphs to kernel imperfect critical digraphs
- New classes of critical kernel-imperfect digraphs
Cites work
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- scientific article; zbMATH DE number 3448611 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Kernels in digraphs with covering number at most 3
- On kernels and semikernels of digraphs
- On monochromatic paths in edge-coloured digraphs
- On weakly ordered systems
- Semikernels modulo \(F\) and kernels in digraphs
- Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
Cited in
(12)- Some sufficient conditions for the existence of kernels in infinite digraphs
- On kernel-perfect critical digraphs
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- New extensions of kernel perfect digraphs to kernel imperfect critical digraphs
- Unions of digraphs which become kernel perfect
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- Semikernels modulo F in digraphs
- A sufficient condition for a digraph to be kernel-perfect
- New classes of critical kernel-imperfect digraphs
- scientific article; zbMATH DE number 1444491 (Why is no real title available?)
- More on discrete convexity
- On a class of kernel-perfect and kernel-perfect-critical graphs
This page was built for publication: Kernel perfect and critical kernel imperfect digraphs structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439612)
