A sufficient condition for a digraph to be kernel-perfect
From MaRDI portal
Publication:3745863
DOI10.1002/jgt.3190110112zbMath0607.05036OpenAlexW2069612071MaRDI QIDQ3745863
Publication date: 1987
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190110112
Related Items (10)
Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs ⋮ On the kernel and related problems in interval digraphs ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Kernels in pretransitive digraphs. ⋮ Graph theoretical structures in logic programs and default theories ⋮ A new generalization of kernels in digraphs ⋮ Kernels in quasi-transitive digraphs ⋮ Kernels and some operations in edge-coloured digraphs ⋮ Domination in Digraphs ⋮ Some sufficient conditions for the existence of kernels in infinite digraphs
Cites Work
This page was built for publication: A sufficient condition for a digraph to be kernel-perfect
