Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992)

From MaRDI portal
Revision as of 23:02, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time
scientific article

    Statements

    Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (English)
    0 references
    0 references
    0 references
    9 May 2016
    0 references
    \(t\)-perfect graphs
    0 references
    claw-free graphs
    0 references
    induced minors
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references