Surjective H-colouring: New hardness results
From MaRDI portal
Publication:5240583
DOI10.3233/COM-180084zbMath1425.05055OpenAlexW2795890907MaRDI QIDQ5240583
Petr A. Golovach, Anthony Stewart, Daniël Paulusma, Matthew Johnson, Barnaby Martin
Publication date: 28 October 2019
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-180084
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Coloring problems on bipartite graphs of small diameter ⋮ Disconnected cuts in claw-free graphs ⋮ The Complexity of Counting Surjective Homomorphisms and Compactions
This page was built for publication: Surjective H-colouring: New hardness results