Kernels in digraphs that are not kernel perfect
From MaRDI portal
Recommendations
- Some sufficient conditions for the existence of kernels in infinite digraphs
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
- Kernels in infinite digraphs
- Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
Cites work
- A graph-theoretic approach to default logic
- Combinatorial game theory foundations applied to digraph kernels
- Expressive power of digraph solvability
- Graph theoretical structures in logic programs and default theories
- On a Theorem of Richardson
- On kernels and semikernels of digraphs
- On kernels, defaults and even graphs
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- Perfect graphs, kernels, and cores of cooperative games
- Solutions of irreflexive relations
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
Cited in
(7)- Almost all digraphs have a kernel
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
- \(H\)-kernels in the \(D\)-join.
- Kernels in weighted digraphs
- Monochromatic kernel-perfectness of special classes of digraphs
- Kernels of digraphs with finitely many ends
- New classes of critical kernel-imperfect digraphs
This page was built for publication: Kernels in digraphs that are not kernel perfect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442354)
