"The Complexity of the List Homomorphism Problem for Graphs."

László Egri et al. (2012)

> Home

Details and statistics

DOI: 10.1007/S00224-011-9333-8

access: closed

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/EgriKLT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/EgriKLT12
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson:
The Complexity of the List Homomorphism Problem for Graphs. Theory Comput. Syst. 51(2): 143-178 (2012)

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.