"The complexity of the list homomorphism problem for graphs"

László Egri et al. (2009)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2019-07-08

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-0912-3802
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0912-3802
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson:
The complexity of the list homomorphism problem for graphs. CoRR abs/0912.3802 (2009)

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.