We investigate graphs and hypergraphs that have (relaxed) product structures. In the class of graphs, we discuss in detail RSP-relations, a relaxation of relations fulfilling the square property and therefore of the product relation σ, that identifies the copies of the prime factors of a graph w.r.t. the Cartesian product. For K2,3-free graphs finest RSP-relations can be computed in polynomial-...