Kernels in digraphs with covering number at most 3

DOI10.1016/S0012-365X(02)00375-8zbMath1014.05029OpenAlexW2051805884MaRDI QIDQ1861206

Hortensia Galeana-Sánchez

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00375-8

zbMATH Keywords

kernelcovering numberkernel-perfect digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Absorbant of generalized de Bruijn digraphs ⋮ Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 ⋮ Kernels by monochromatic paths in digraphs with covering number 2 ⋮ Kernel perfect and critical kernel imperfect digraphs structure

This page was built for publication: Kernels in digraphs with covering number at most 3