The t-onion star is the digraph obtained from a star with 2t leaves by
r...
The generic homomorphism problem, which asks whether an input graph G
ad...
For graphs G and H, an H-coloring of G is an edge-preserving mapping
fro...
We revisit recent developments for the Maximum Weight Independent Set pr...
A homomorphism from a graph G to a graph H is an edge-preserving mapping...
Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjo...
Tree-cut width is a graph parameter introduced by Wollan that is an anal...
A permutation graph can be defined as an intersection graph of segments ...
A homomorphism from a graph G to a graph H is an edge-preserving mapping...
The notion of forbidden-transition graphs allows for a robust generaliza...
We investigate the List H-Coloring problem, the generalization of graph
...
A homomorphism from a graph G to a graph H is an edge-preserving mapping...
Let C and D be hereditary graph classes. Consider the
following problem:...
For graphs G and H, a homomorphism from G to H is an
edge-preserving map...
We consider the complexity of finding weighted homomorphisms from
inters...
An edge labeling of a graph distinguishes neighbors by sets (multisets,
...