21 citations · 31 across the 12 of their papers we have counts for
4 papers · 1 filter
List homomorphisms to separable signed graphs
Jan Bok, Richard Brewster, Tomás Feder +2
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and refle…
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints
Tom\' as Feder, Pavol Hell, Carlos Subi
We consider acyclic r-colorings in graphs and digraphs: they color the vertices in r colors, each of which induces an acyclic graph or digraph. (This includes the dichromatic numbe…
Complexity of Correspondence Homomorphisms
Tomas Feder, Pavol Hell
Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph , the problem is to…
Matrix Partitions of Split Graphs
Tomás Feder, Pavol Hell, Oren Shklarsky
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition pro…