New constructions for the $n$-queens problem
Abstract
Let be a digraph, possibly with loops. A queen labeling of is a bijective function such that, for every pair of arcs in , namely and we have (i) and (ii) . Similarly, if the two conditions are satisfied modulo , we define a modular queen labeling. There is a bijection between (modular) queen labelings of -regular digraphs and the solutions of the (modular) -queens problem. The -product was introduced in 2008 as a generalization of the Kronecker product and since then, many relations among labelings have been established using the -product and some particular families of graphs. In this paper, we study some families of -regular digraphs that admit (modular) queen labelings and present a new construction concerning to the (modular) -queens problem in terms of the -product, which in some sense complements a previous result due to P\'olya.
Cite
@article{arxiv.1703.09942,
title = {New constructions for the $n$-queens problem},
author = {Martin Bača and Susana-Clara López and Francesc-Antoni Muntaner-Batle and Andrea Semaničová-Feňovčíková},
journal= {arXiv preprint arXiv:1703.09942},
year = {2019}
}
Comments
11 pages, 3 figures