ABSTRACT
Any connected graph in Γ factors uniquely into primes over the strong product, and connected nonbipartite graphs in Γ0 factor uniquely over the direct product. Unique prime factorization is not so common for the lexicographic product, but Chapter 10 described transformations that lead from one prime factorization to all others.
