β Scribed by Amanda G. Chetwynd; Susan J. Rhodes
No coin nor oath required. For personal study only.
In this paper we consider the problem posed by H~iggkvist on finding n x n arrays which are avoidable. An array is said to be avoidable if an n x n latin square on the same symbols can be found which differs from the given array in every cell. We describe a family of arrays, known as chessboard arrays, and classify these arrays as avoidable or non-avoidable.
π SIMILAR VOLUMES
The companion novel to Tomorrow and Tomorrow, this book, under the deft touch of Lewis Padgett, makes fascinating and exciting reading. It concerns Robert Cameron, trained in applied psychology, who finds himself being driven insane by a strange, unfathomable force. As an experienced psychometrician
A graph may be formed from an n x n chessboard by taking the squares as the vertices and two vertices are adjacent if a chess piece situated on one square covers the other. In this paper we survey some recent results concerning domination parameters for certain graphs constructed in this way.