The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs (Q1213881)

From MaRDI portal
Revision as of 15:00, 12 June 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
The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
scientific article

    Statements

    The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs (English)
    0 references
    0 references
    0 references
    1976
    0 references

    Identifiers