A sufficient condition for a digraph to be kernel-perfect
From MaRDI portal
Recommendations
- Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- Kernels in digraphs with covering number at most 3
- Kernel perfect and critical kernel imperfect digraphs structure
Cites work
Cited in
(19)- A note on Duchet's conjecture
- Some sufficient conditions for the existence of kernels in infinite digraphs
- A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- Kernels in a special class of digraphs
- Kernels in pretransitive digraphs.
- On kernels in i-triangulated graphs
- A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs
- Unions of digraphs which become kernel perfect
- Perfect graphs, kernels, and cores of cooperative games
- Kernels in quasi-transitive digraphs
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- Domination in digraphs
- Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel
- A new generalization of kernels in digraphs
- On the kernel and related problems in interval digraphs
- Graph theoretical structures in logic programs and default theories
- Kernels and some operations in edge-coloured digraphs
This page was built for publication: A sufficient condition for a digraph to be kernel-perfect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745863)
