Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857)

From MaRDI portal
Revision as of 12:58, 22 May 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
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
scientific article

    Statements

    Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (English)
    0 references
    3 July 1994
    0 references
    0 references
    orientable graphs
    0 references
    chromatic number
    0 references
    colors
    0 references
    clique number
    0 references
    complete subgraph
    0 references
    strong perfect graph conjecture
    0 references
    0 references