Categories
Math & Stats Student research

Complexity of graph homomorphism problems with switching

Luke Ingalls (MATH) presents: “Complexity of graph homomorphism problems with switching” for Honours Fest 2024. Research supervised by Gary MacGillivray.

Skip to content