Realizing disjoint degree sequences of span two: a solvable discrete tomography problem
Flavio Gu ́ inez, Stéphan Thomassé · 2008
We consider the problem of coloring a grid using p colors with the requirement that each row and each column has a specific total number of entries of each color. Ryser [16], and independently Gale [8], obtained a necessary and sucient condition for the existence of such a coloring when two colors are considered. This characterization yields a linear time algorithm for constructing the coloring when it exists. Chrobak a)