Inproceedings,

Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization.

, , and .
STACS, volume 96 of LIPIcs, page 27:1-27:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

Meta data

Tags

Users

  • @dblp

Comments and Reviews