Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree

David E. Roberson

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they pres…