We investigate the computational complexity of graph primality testing problem with respect to direct product (also known as Kronecker, cardinal or tensor product). In [1] Imrich proves that both and a unique prime factorization can be determined in polynomial time for (finite) connected nonbipartite graphs. The author states an open how results on nonbipartite, graphs extend bipartite disconne...