Skip to main content
Article thumbnail
Location of Repository

The complexity of signed and edge-coloured graph homomorphisms.

By Brewster Richard, Foucaud Folrent, Hell Pavol and Reza Naserasr

Abstract

International audienc

Topics: [ MATH ] Mathematics [math], [ INFO ] Computer Science [cs]
Publisher: Elsevier
Year: 2017
OAI identifier: oai:HAL:hal-01520743v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.