Parity graphs are kernel-M-solvable (Q1121920): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3203055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parity digraph has a kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222874 / 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: Q5659563 / rank
 
Normal rank

Latest revision as of 15:43, 19 June 2024

scientific article
Language Label Description Also known as
English
Parity graphs are kernel-M-solvable
scientific article

    Statements

    Parity graphs are kernel-M-solvable (English)
    0 references
    0 references
    1987
    0 references
    orientation
    0 references
    parity graph
    0 references
    perfect graphs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers