Three-colourability and forbidden subgraphs. II: Polynomial algorithms (Q1613477)

From MaRDI portal
Revision as of 23:41, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Three-colourability and forbidden subgraphs. II: Polynomial algorithms
scientific article

    Statements

    Three-colourability and forbidden subgraphs. II: Polynomial algorithms (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    colouring algorithms
    0 references
    chromatic number
    0 references
    forbidden induced subgraphs
    0 references
    3-colourability
    0 references
    graph class
    0 references