Mark Siggers, The list switch homomorphism problem for signed graphs
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 …
1 event found.
기초과학연구원 이산수학그룹