Home > Research > Publications & Outputs > Chessboard squares.
View graph of relations

Chessboard squares.

Research output: Contribution to Journal/MagazineJournal article

Published
<mark>Journal publication date</mark>28/06/1995
<mark>Journal</mark>Discrete Mathematics
Issue number1-3
Volume141
Number of pages13
Pages (from-to)47-59
Publication StatusPublished
<mark>Original language</mark>English

Abstract

In this paper we consider the problem posed by Häggkvist on finding n × n arrays which are avoidable. An array is said to be avoidable if an n × 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.