Cancellation of digraphs over the direct product

We use a construction called the factorial A! of a digraph A. Given digraphs A and C, the digraph A! carries information that determines the complete set of solutions X to the digraph equation A×C≅X×C. We state the exact conditions under which there is only one solution X (namely X≅A) and that is the situation in which cancellation holds.