A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bibliography on domination in graphs and some basic definitions of domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination number in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem in logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of irreflexive relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes Noyau-Parfaits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernels and semikernels of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernel-perfect critical digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semikernels modulo \(F\) and kernels in digraphs / rank
 
Normal rank

Latest revision as of 18:23, 11 July 2024

scientific article
Language Label Description Also known as
English
A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\)
scientific article

    Statements

    A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (English)
    0 references
    0 references
    0 references
    7 April 2016
    0 references
    0 references
    digraphs
    0 references
    kernel
    0 references
    kernel-perfect digraph
    0 references
    semikernel
    0 references
    0 references