About quasi-kernels in a digraph (Q1918561)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: About quasi-kernels in a digraph |
scientific article; zbMATH DE number 906910
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | About quasi-kernels in a digraph |
scientific article; zbMATH DE number 906910 |
Statements
About quasi-kernels in a digraph (English)
0 references
18 July 1996
0 references
The authors prove that every digraph without kernel possesses at least three quasi-kernels. They give an example of a digraph with \(n\) vertices (for every \(n\geq 3\)) with exactly three quasi-kernels.
0 references
digraph
0 references
kernel
0 references
quasi-kernels
0 references
0 references
0.9640815
0 references
0 references
0 references
0.92865205
0 references
0.91859597
0 references
0.9146713
0 references
