COMBINATORICS
1999
13 years 6 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
DCC
2003
IEEE
14 years 6 months ago
2003
IEEE
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...
DCC
2006
IEEE
14 years 6 months ago
2006
IEEE
Using Hadamard matrices and mutually orthogonal Latin squares, we construct two new quasi-symmetric designs, with parameters 2 (66, 30, 29) and 2 - (78, 36, 30). These are the fir...