About quasi-kernels in a digraph (Q1918561): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Henry Jacob / rank
 
Normal rank
Property / author
 
Property / author: Henri Meyniel / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Matúš Harminc / rank
 
Normal rank

Revision as of 20:19, 10 February 2024

scientific article
Language Label Description Also known as
English
About quasi-kernels in a digraph
scientific article

    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
    0 references
    digraph
    0 references
    kernel
    0 references
    quasi-kernels
    0 references
    0 references
    0 references