"The complexity of signed graph and edge-coloured graph homomorphisms."

Richard C. Brewster et al. (2017)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2016.08.005

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/BrewsterFHN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BrewsterFHN17
Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340(2): 223-235 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.