Home > Research > Publications & Outputs > Chessboard squares.

Research

Links

Text available via DOI:

View graph of relations

Chessboard squares.

Research output: Contribution to Journal/Magazine › Journal article

Published

Standard

Chessboard squares. / Chetwynd, Amanda G.; Rhodes, S. J.
In: Discrete Mathematics, Vol. 141, No. 1-3, 28.06.1995, p. 47-59.

Research output: Contribution to Journal/Magazine › Journal article

Harvard

Chetwynd, AG & Rhodes, SJ 1995, 'Chessboard squares.', Discrete Mathematics, vol. 141, no. 1-3, pp. 47-59. https://doi.org/10.1016/0012-365X(94)E0206-W

APA

Chetwynd, A. G., & Rhodes, S. J. (1995). Chessboard squares. Discrete Mathematics, 141(1-3), 47-59. https://doi.org/10.1016/0012-365X(94)E0206-W

Vancouver

Chetwynd AG, Rhodes SJ. Chessboard squares. Discrete Mathematics. 1995 Jun 28;141(1-3):47-59. doi: 10.1016/0012-365X(94)E0206-W

Author

Chetwynd, Amanda G. ; Rhodes, S. J. / Chessboard squares. In: Discrete Mathematics. 1995 ; Vol. 141, No. 1-3. pp. 47-59.

Bibtex

@article{cc4679e594054ed2af913c8231396bd7,
title = "Chessboard squares.",
abstract = "In this paper we consider the problem posed by H{\"a}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.",
author = "Chetwynd, {Amanda G.} and Rhodes, {S. J.}",
year = "1995",
month = jun,
day = "28",
doi = "10.1016/0012-365X(94)E0206-W",
language = "English",
volume = "141",
pages = "47--59",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

RIS

TY - JOUR

T1 - Chessboard squares.

AU - Chetwynd, Amanda G.

AU - Rhodes, S. J.

PY - 1995/6/28

Y1 - 1995/6/28

N2 - 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.

AB - 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.

U2 - 10.1016/0012-365X(94)E0206-W

DO - 10.1016/0012-365X(94)E0206-W

M3 - Journal article

VL - 141

SP - 47

EP - 59

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -