Mark Siggers gave a talk on the complexity of the list switch homomorphism problem for signed graphs at the Discrete Math Seminar

On May 11, 2021, Mark Siggers from the Kyungpook National University gave a talk at the Discrete Math Seminar about the complexity of deciding whether there is a list homomorphism from a signed graph G to another signed graph switching equivalent to H. The title of his talk was “The list switch homomorphism problem for signed graphs“.