Determining optimally ordered pairs using edge-coloring of graphs

Tables to find optimally ordered pairs for the assessment of judgemental information were published. The optimality of such orders according to spacing and balance requirements is proved using edge-colorings of graphs. In addition, the constructive proof leads to an elegant algorithm for constructing orders by hand without consulting tables.<
>