Complexity of correspondence \(H\)-colourings (Q2184689): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A complexity dichotomy for signed \(\mathbf{H}\)-colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Homomorphisms with Complex Values: A Dichotomy Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally constrained graph homomorphisms -- structure, complexity, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tropical graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing vertex-surjective homomorphisms to partially reflexive trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitions with prescribed patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank

Latest revision as of 20:22, 22 July 2024

scientific article
Language Label Description Also known as
English
Complexity of correspondence \(H\)-colourings
scientific article

    Statements

    Complexity of correspondence \(H\)-colourings (English)
    0 references
    0 references
    0 references
    29 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references