Surjective \(H\)-colouring: new hardness results (Q2011662): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963006808 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.02188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of surjective homomorphism problems-a survey / 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: Retractions to Pseudoforests / 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: A complete complexity classification of the role assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding vertex-surjective graph homomorphisms / 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: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of disconnected cut and \(2 K_2\)-partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction, Retraction, and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for partition of some class of graphs under compaction and vertex-compaction / rank
 
Normal rank

Latest revision as of 05:05, 14 July 2024

scientific article
Language Label Description Also known as
English
Surjective \(H\)-colouring: new hardness results
scientific article

    Statements

    Surjective \(H\)-colouring: new hardness results (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2017
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references