Complexity of correspondence \(H\)-colourings (Q2184689)

From MaRDI portal
Revision as of 19:22, 22 July 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
Complexity of correspondence \(H\)-colourings
scientific article

    Statements

    title
    Complexity of correspondence \(H\)-colourings (English)
    0 references
    author
    Tomás Feder
    0 references
    Pavol Hell
    0 references
    publication date
    29 May 2020
    0 references
    zbMATH Keywords
    graph homomorphisms
    0 references
    \(H\)-colourings
    0 references
    correspondence colourings
    0 references
    DP-colourings
    0 references
    dichotomy
    0 references
    NP-completeness
    0 references
    polynomial algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C60
    0 references
    05C15
    0 references
    68Q17
    0 references
    zbMATH DE Number
    7206543
    0 references
    OpenAlex ID
    W2990687474
    0 references
    arXiv ID
    1703.05881
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2184689&oldid=36589900"
    Powered by MediaWiki