On the existence of kernels and \(h\)-kernels in directed graphs

DOI10.1016/0012-365X(92)90713-PzbMath0770.05050OpenAlexW2153262014MaRDI QIDQ1208364

Hortensia Galeana-Sánchez

Publication date: 16 May 1993

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

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

zbMATH Keywords

\(h\)-kernelcyclically \(h\)-partite strongly connected digraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

Alternating kernels ⋮ Graph theoretical structures in logic programs and default theories ⋮ (k,l)-kernels in line digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the existence of (k,\(\ell)\)-kernels in digraphs
• On kernel-perfect critical digraphs
• Graphes Noyau-Parfaits

This page was built for publication: On the existence of kernels and \(h\)-kernels in directed graphs