Colouring Some Classes of Perfect Graphs Robustly (Q3439399)

From MaRDI portal
Revision as of 20:09, 25 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
Colouring Some Classes of Perfect Graphs Robustly
scientific article

    Statements

    Colouring Some Classes of Perfect Graphs Robustly (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    perfect graph
    0 references
    graph colouring
    0 references
    meyniel graph
    0 references
    intersection graph
    0 references
    existentially polytime theorem
    0 references
    0 references