research
∙
05/26/2022
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws
For graphs G and H, an H-coloring of G is an edge-preserving mapping fro...
share
research
∙
04/28/2021
Faster 3-coloring of small-diameter graphs
We study the 3-Coloring problem in graphs with small diameter. In 2013, ...
research
∙
09/24/2020
Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth
For graphs G,H, a homomorphism from G to H is an edge-preserving mapping...
research
∙
06/19/2020