His parents were immigrants from Bessarabia. Deter has been a visiting scho- lar at a number of research institutions, including University of São Paulo, Instituto Nacional de Matemática Pura e Aplicada, Federal University of Rio Grande do Sul, University of Cambridge, National Autonomous University of Mexico, Simon Fraser University, University of Victoria, New York University, University of Illinois at Urbana-Champaign, McMaster University, DIMACS, Autonomous University of Barcelona, Technical University of Denmark, Auburn University, Polytechnic University of Catalonia, Technical University of Madrid, Charles University, Ottawa University and Simón Bolivar University. Recalling that each edge of a graph H has two oppositely oriented arcs, each vertex v of H is identified with the set ofarcs (v,e) departing from v along the edges e of H incident to v. Let H be a (1,)-biregular graph with bipartition (Y,X), where |Y|=kM and |*|=k1, wherek<0, 1and uare integers. In, Deter considered the problem of assigning, for each edge e=yx of H, a color given by an element of Y, respectively X, to the arc (ye), respectively (x,), so that each color is assigned exactly once in the set of arcs departing from each vertex of H. Furthermore, Deter set such assignment to fulfill a specific bicolor weight function over amono- tonic subset of Y×X, pointing that this problem applies to the Design of Experiments for Industrial Chemistry, Molecular Biology, Cellular Neuroscience, etc.