Perfect graphs with polynomially computable kernels (Q2283107)

From MaRDI portal
Revision as of 20:47, 14 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128983564, #quickstatements; #temporary_batch_1723663638014)
scientific article
Language Label Description Also known as
English
Perfect graphs with polynomially computable kernels
scientific article

    Statements

    Perfect graphs with polynomially computable kernels (English)
    0 references
    0 references
    0 references
    0 references
    30 December 2019
    0 references
    chordal graph
    0 references
    claw-free perfect graph
    0 references
    clique-cutset
    0 references
    kernel
    0 references
    orientation of perfect graph
    0 references
    Boros-Gurvich theorem
    0 references

    Identifiers