ABSTRACT
Given a graph product ∗, it is natural to seek the conditions under which A ∗ C ∼= B ∗ C implies A ∼= B. We call this the cancellation problem for the product. For the Cartesian product, the solution is straightforward. Theorem 6.21 says A2C ∼= B2C implies A ∼= B, provided that C is not the empty graph. Because of this, we say that cancellation holds for the Cartesian product.
