Finding the prime factors of strong direct product graphs in polynomial time

Abstract

The strong direct product is one of several standard product operators on graphs. Dörfler and Imrich (1969) and, independently, McKenzie (1971) showed that any connected graph has a unique prime factorization under the strong direct product. We give a polynomial-time algorithm for finding this unique factorization, thus settling a question of Nešetřil.