In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct
row-complete latin squares, Keedwell published a survey of all the available results …

A Latin square is pan-Hamiltonian if every pair of rows forms a single cycle. Such squares
are related to perfect 1-factorisations of the complete bipartite graph. A square is atomic if …

Let us denote by Ω n the Birkhoff polytope of n× n doubly stochastic matrices. As the Birkhoff–
von Neumann theorem famously states, the vertex set of Ω n coincides with the set of all n× n …

A subset S of {0, 1,…, 2t-1} n is called a t-fold MDS code if every line in each of n base
directions contains exactly t elements of S. The adjacency graph of a t-fold MDS code is not …

Given a sequence g: g 0,…, gm g:g_0,...,g_m in a finite group GG with g 0= 1 G g_0=1_G, let
g¯: g¯ 0,…, g¯ m ̄g:̄g_0,...,̄g_m be the sequence of consecutive quotients of gg defined …

In this paper we study a graph operation which produces what we call the “vertex
envelope”[Formula: see text] from a graph G. We apply it to plane cubic graphs and …

A finite latin square is an n× n matrix whose entries are elements of the set {1,…, n} and no
element is repeated in any row or column. Given equivalence relations on the set of rows …

A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares -
Schroeder - 2019 - Journal of Combinatorial Designs - Wiley Online Library Skip to Article …

Given a one-factorization F of the complete bipartite graph Kn; n, let pf (F) de-note the
number of Hamiltonian cycles obtained by taking pairwise unions of perfect matchings in F …

A terrace for ℤ< sub> m is an arrangement a< sub> 1, a< sub> 2,…, a< sub> m) of the m
elements of ℤ< sub> m such that the sets of differences a< sub> i+ 1-a< sub> i and a< sub> …