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

From MaRDI portal
Revision as of 03:02, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The complexity of \(G\)-free colourability
scientific article

    Statements

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

    Identifiers

    Mathematics Subject Classification ID
    05C15
    0 references
    68Q25
    0 references
    68R10
    0 references
    zbMATH DE Number
    1019082
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1356726&oldid=26167809"
    Powered by MediaWiki