The complexity of \(G\)-free colourability (Q1356726)

From MaRDI portal
Revision as of 14:12, 27 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
The complexity of \(G\)-free colourability
scientific article

    Statements

    The complexity of \(G\)-free colourability (English)
    0 references
    5 November 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    chromatic number
    0 references
    2-colourable
    0 references
    polynomial time algorithm
    0 references
    bipartition
    0 references
    NP-complete
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references