希腊拉丁方阵（英语：Graeco-Latin square）为两个拉丁方阵相正交所得到的方阵。

它跟数独一样，每一行、每一列都不会重复，并且每一个拉丁字母与每一希腊字母只配对一次，就称这两方阵互为正交 (orthogonal)，叠合后的方阵称为希腊拉丁方阵，拉丁方阵 n orders 就有 n-1 个正交方阵(orthogonal square)。

In combinatorics, a Graeco-Latin square or Euler square or orthogonal Latin squares of order n over two sets S and T, each consisting of n symbols, is an n×n arrangement of cells, each cell containing an ordered pair (s,t), where s is in S and t is in T, such that every row and every column contains each element of S and each element of T exactly once, and that no two cells contain the same ordered pair.