A new characterization of perfect graphs (Q442410): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent problems and results about kernels in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs are kernel solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs, kernels, and cores of cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernel-perfect critical digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank

Latest revision as of 12:47, 5 July 2024

scientific article
Language Label Description Also known as
English
A new characterization of perfect graphs
scientific article

    Statements

    A new characterization of perfect graphs (English)
    0 references
    10 August 2012
    0 references
    kernel
    0 references
    perfect graph
    0 references

    Identifiers