Combinatorial optimization games deal with cooperative games for which the value of every
subset of players is obtained by solving a combinatorial optimization problem on the …

The set of integers k for which there exist three latin squares of order n having precisely k
cells identical, with their remaining n 2− k cells different in all three latin squares, denoted by …

The following open problem was proposed by Archdeacon: Characterize all graphical
sequences π such that some realization of π admits a nowhere-zero 3-flow. The purpose of …

It is proved in this paper that every bipartite graphic sequence with the minimum degree δ≥
2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture …

A μ-way latin trade of volume s is a set of μ partial latin rectangles (of inconsequential size)
containing exactly the same s filled cells, such that if cell (i, j) is filled, it contains a different …

A latin interchange is a pair of disjoint partial latin squares of the same shape and order
which are row–wise and column–wise mutually balanced. In this paper we document a …

To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988
and 1994) considered some module spaces. Here, using a linear algebraic approach we …

Constructing and deconstructing latin trades - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

A 3-way T-trade consists of three disjoint decompositions of some simple graph H without
isolated vertices into copies of T. The number of vertices of the graph H is the foundation of …

A $ mu $-way $ G $-trade ($ mu geq 2) $ consists of $ mu $ disjoint decompositions of some
simple (underlying) graph $ H $ into copies of a graph $ G. $ The number of copies of the …