Graph congruences and wreath products

Abstract Results on graph congruences have recently been used to decide membership in varieties defined by wreath products. The general technique for doing so is explained. In particular an efficient algorithm is obtained for deciding when a semigroup divides a wreath product of a commutative monoid with locally trivial semigroup.