### Mark Siggers, The list switch homomorphism problem for signed graphs

Room B232 IBS (기초과학연구원)A signed graph is a graph in which each edge has a positive or negative sign. Calling two graphs switch equivalent if one can get from one to the other by the iteration of the local action of switching all signs on edges incident to a given vertex, we say that there is a switch …