Colouring, constraint satisfaction, and complexity (Q458466)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Colouring, constraint satisfaction, and complexity
scientific article

    Statements

    title
    Colouring, constraint satisfaction, and complexity (English)
    0 references
    author
    Pavol Hell
    0 references
    Jaroslav Nešetřil
    0 references
    publication date
    7 October 2014
    0 references
    cites work
    Q3184605
    0 references
    Q3424887
    0 references
    Q3424888
    0 references
    Q5501285
    0 references
    Q4677979
    0 references
    Q5715675
    0 references
    Q3113761
    0 references
    Q4058132
    0 references
    List Partitions
    0 references
    Q2921752
    0 references
    Q3424776
    0 references
    Q4521527
    0 references
    Q4193514
    0 references
    Q5545303
    0 references
    Q4198056
    0 references
    Q3328583
    0 references
    Q3565872
    0 references
    Q3615793
    0 references
    Q3903002
    0 references
    Q4049082
    0 references
    Q3424890
    0 references
    Q4432211
    0 references
    The core of a graph
    0 references
    Q4878664
    0 references
    Q4660723
    0 references
    Q4828516
    0 references
    Q4838466
    0 references
    Q3730636
    0 references
    Q5471351
    0 references
    Q3424784
    0 references
    Q4094884
    0 references
    Q4871773
    0 references
    Cuts and bounds
    0 references
    Folding
    0 references
    Q4332422
    0 references
    Q3208855
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68T20
    0 references
    05C15
    0 references
    68Q25
    0 references
    68-02
    0 references
    zbMATH DE Number
    6352099
    0 references
    OpenAlex ID
    W2199961663
    0 references
    Wikidata QID
    Q56389140
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q458466&oldid=36802442"
    Powered by MediaWiki