Almost all digraphs have a kernel

DOI10.1016/0012-365X(90)90373-PMaRDI QIDQ915737zbMATH OpenOpenAlexFDO

Authors Ioan Tomescu

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90373-p

zbMATH Keywords

kerneldigraphdirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 4212085
• A parity digraph has a kernel
• Kernels in a special class of digraphs
• A sufficient condition for the existence of k-kernels in digraphs
• Kernels of digraphs with finitely many ends
• Kernels in circulant digraphs
• Kernels in digraphs that are not kernel perfect
• On the existence of (k,\(\ell)\)-kernels in digraphs
• Kernels in planar digraphs
• About quasi-kernels in a digraph

Cites work

• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• On cliques in graphs

Cited in

(3)

• A note on the kernel number
• Graph theoretical structures in logic programs and default theories
• Kernels in planar digraphs

This page was built for publication: Almost all digraphs have a kernel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915737)