þÿ<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html40/strict.dtd"> <!-- Created from PDF via Acrobat SaveAsXML --> <!-- Mapping table version: 28-February-2003 --> <HTML> <HEAD> <LINK REL="SHORTCUT ICON" HREF="http://www.math.toronto.edu/mendelso/bannericon.ico" > <META http-equiv="Content-Type" content="text/html; charset=UTF-8"> <STYLE type="text/css"> DIV[class="Part"] { text-align:left; margin-bottom:0px; margin-top:0px; margin-right:0px; margin-left:0px; text-indent:0px; direction:ltr } H1 { text-align:center; margin-bottom:49px; margin-top:0px; margin-right:0px; margin-left:0px; text-indent:0px; direction:ltr; line-height:24px } SPAN { font-family:'','Fg',sans-serif; font-size:14.3pt; font-style:normal; font-weight:normal } P { text-align:justify; margin-bottom:0px; margin-top:0px; margin-right:0px; margin-left:27px; text-indent:-20px; direction:ltr; line-height:16px } </STYLE> <META name="DC.Title" content="Untitled.dvi" > <META name="DC.Creator" content="dvips(k) 5.94a Copyright 2003 Radical Eye Software" > <META name="DC.Date" content="2006-02-16T16:50:00" > <META name="DC.Date.Modified" content="2006-02-16T16:50:00" > </HEAD> <BODY bgcolor=#CCCCFF text=black link=blue vlink=purple alink=fushia > <DIV class="Part" ><H1> <SPAN style="color:#000000" >Publications by E.Mendelsoh</SPAN ><SPAN style="color:#000000" >n </SPAN ><SPAN style="color:#000000" >Reviewed in Math Review</SPAN ><SPAN style="color:#000000" >s </SPAN ></H1> <P> <SPAN style="font-size:9.9pt; color:#000000" >[1] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Peter Dukes and Eric Mendelsohn. Quasi-embeddings of Steiner triple systems, or Steiner triple systems of diûerent orders with maximum intersection. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Des.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 13(2):120 138, 2005. MR2116196 (2005h:05025). </SPAN ></P> <P> <SPAN style="font-size:9.9pt; color:#000000" >[2] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Peter Danziger, Eric Mendelsohn, and Gaetano Quattrocchi. On the chromatic index of path decompositions. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 284(1-3):107 121, 2004. MR2071901 (2005g:05051). </SPAN ></P> <P> <SPAN style="font-size:9.9pt; color:#000000" >[3] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Gaetano Quattrocchi and Eric Mendelsohn. Minimum embedding of balanced </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >P</SPAN ><SPAN style="font-size:6.9pt; color:#000000" >4</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >-designs into 5-cycle systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 279(1-3):407 421, 2004. In honour of Zhu Lie. MR2060004 (2005a:05034). </SPAN ></P> <P> <SPAN style="font-size:9.9pt; color:#000000" >[4] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Brett Stevens and Eric Mendelsohn. Packing arrays. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Theoret. Comput. Sci.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 321(1):125 148, 2004. MR2069326 (2005g:05038). </SPAN ></P> <P> <SPAN style="font-size:9.9pt; color:#000000" >[5] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Peter Danziger and Eric Mendelsohn. Bicolour graphs of Steiner triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 261(1-3):157  176, 2003. Papers on the occasion of the 65th birthday of Alex Rosa. MR1961744 (2004a:05022). </SPAN ></P> <P> <SPAN style="font-size:9.9pt; color:#000000" >[6] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn, M. Meszka, and A. Rosa. Packing Petersen graphs into </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >K</SPAN ><SPAN style="font-size:6.9pt; color:#000000" >10</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Bull. Inst. Combin. Appl.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 39:85 86, 2003.MR1999861 (2004f:05146). </SPAN ></P> <P> <SPAN style="font-size:9.9pt; color:#000000" >[7] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Brett Stevens, Alan Ling, and Eric Mendelsohn. A directconstruction oftransversalcovers using group divisible designs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 63:145 159, 2002. MR1898223 (2002m:05039). </SPAN ></P> <P> <SPAN style="font-size:9.9pt; color:#000000" >[8] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Brett Stevens and Eric Mendelsohn. Packingarrays and packing designs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Des. Codes Cryptogr.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 27(1-2):165 176, 2002. Special issue in honour of Ronald C. Mullin, Part II. MR1923402 (2003h:05053). </SPAN ></P> <P> <SPAN style="font-size:9.9pt; color:#000000" >[9] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Brett Stevens and Eric Mendelsohn. Packingarrays. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >LATIN 2002: Theoretical informatics (Cancun)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 2286 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Lecture Notes in Comput. Sci.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 293 305. Springer, Berlin, 2002. MR1966130. </SPAN ></P> <P style="margin-bottom:-15px; margin-left:0px; text-indent:0px"> <SPAN style="font-size:9.9pt; color:#000000" >[10] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Andr´e K(r)</SPAN ></P> <P style="text-indent:52px; line-height:16px"> <SPAN style="font-size:9.9pt; color:#000000" >undgen, Eric Mendelsohn, and Vitaly Voloshin. Colouring planar mixed hypergraphs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Electron. J. Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 7:Research Paper 60, 13 pp. (electronic), 2000. MR1799072 (2002g:05085). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[11] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ming-Chu Li, Derek G. Corneil, and Eric Mendelsohn. Pancyclicity and NP-completeness in planar graphs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Discrete Appl. Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 98(3):219 225, 2000. MR1733672 (2000i:68153). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[12] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn and G. Quattrocchi. Resolving triple systems into regular conûgurations. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Electron. J. Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 7:Research Paper 2, 18 pp. (electronic), 2000.MR1736718 (2000k:05049). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[13] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn and Bridget S. Webb. Orbits on cycles of automorphisms. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Util. Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 58:33 44, 2000. MR1801300 (2001k:05035). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[14] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >P. Dukes and E. Mendelsohn. Skew-orthogonal Steiner triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Des.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 7(6):431 440, 1999. MR1711885 (2001d:05021). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[15] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. S. Mahmoodian and E. Mendelsohn. On deûning numbers of vertex colouring of regular graphs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 197/198:543 554, 1999. 16th British Combinatorial Conference (London, 1997). MR1674887 (99i:05085). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[16] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn and N. Shalaby. On Skolem labelling of windmills. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 53:161 172, 1999. MR1724498 (2000h:05191). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[17] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Brett Stevens and Eric Mendelsohn. New recursive methods for transversal covers. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Des.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 7(3):185  203, 1999.MR1681504 (2000a:05053). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[18] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >L. Haddad, P. Hell, and E. Mendelsohn. On the complexity of coloring areûexive </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >h</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >-ary relations with given permutation group. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 48:111 128, 1998. MR1622987 (99d:05033). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[19] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Brett Stevens, Lucia Moura, and Eric Mendelsohn. Lower bounds for transversal covers. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Des. Codes Cryptogr.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 15(3):279 299, 1998.MR1658626 (99m:68144). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[20] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >P. Danziger and E. Mendelsohn. Intercalates everywhere. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Geometry, combinatorial designs and related structures (Spetses, 1996)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 245 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >London Math. Soc. Lecture Note Ser.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 69 88. Cambridge Univ. Press, Cambridge, 1997.MR1700841 (2000g:05035). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[21] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >I. J. Dejter, F. Franek, E. Mendelsohn, and A. Rosa. Triangles in 2-factorizations. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Graph Theory</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 26(2):83 94, 1997.MR1469355 (98e:05086). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[22] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. S. Mahmoodian and E. Mendelsohn. On the deûning numbers of vertex coloring of regular graphs. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Proceedings of the 28th Annual Iranian Mathematics Conference, Part 1 (Tabriz, 1997)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 377 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Tabriz Univ. Ser.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 327 330. Tabriz Univ., Tabriz, 1997. MR1625325 (99c:05067). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[23] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn and Alexander Rosa. Ubiquitous conûgurations in Steiner triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin.Des.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 5(1):13 31, 1997.MR1421247 (97h:05026). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[24] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >P. Danziger, E. Mendelsohn, M. J. Grannell, and T. S. Griggs. Five-line conûgurations in Steiner triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Utilitas Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 49:153 159, 1996. MR1396296 (97h:05025). </SPAN ></P> <P style="text-indent:0px"> <SPAN style="font-size:9.9pt; color:#000000" >systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Des.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 3(1):51 59, 1995. MR1305447 (95j:05041). </SPAN ></P> <P style="margin-bottom:-15px; margin-left:0px; text-indent:0px"> <SPAN style="font-size:9.9pt; color:#000000" >[28] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, and Jozef </SPAN ><SPAN style="font-size:9.9pt; color:#000000" ><Sup>Ç</Sup></SPAN ><SPAN style="font-size:9.9pt; color:#000000" >aÇ</SPAN ></P> <P style="text-indent:403px; line-height:16px"> <SPAN style="font-size:9.9pt; color:#000000" >Sir´n. Anti-mitre Steiner triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Graphs Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 10(3):215 224, 1994. MR1304375 (95j:05040). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[29] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Guo-Gang Gao, Eric Mendelsohn, and Hui Shan Zhou. Computing star chromatic number from related graph invariants. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Math. Combin. Comput.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 16:87 95, 1994. MR1301212 (95j:05091). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[30] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >P. B. Gibbons, E. Mendelsohn, and H. Shen. Antipodal triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Australas. J. Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 9:137 151, 1994. MR1271197 (95b:05031). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[31] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Terry S. Griggs, Eric Mendelsohn, and Alexander Rosa. Simultaneous decompositions of Steiner triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 37:157 173, 1994. MR1282554 (95d:05023). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[32] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn and P. Rodney. The existence of court balanced tournament designs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 133(1-3):207 216, 1994.MR1298975 (95g:05018). </SPAN ></P> <P style="margin-bottom:-15px; margin-left:0px; text-indent:0px"> <SPAN style="font-size:9.9pt; color:#000000" >[33] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >V´</SPAN ></P> <P style="text-indent:10px"> <SPAN style="font-size:9.9pt; color:#000000" >aclav Linek and Eric Mendelsohn. 3-(</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >v, </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >4</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >1) covering designs with chromatic numbers 2 and 3. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Des.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 1(6):411 434, 1993. MR1303953 (95k:05018). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[34] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, and Vladimir D. Tonchev. Concerning multiplier automorphisms ofcyclic Steiner triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Des. Codes Cryptogr.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 2(3):237 251, 1992. MR1181731 (93g:05020). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[35] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn, Nabil Shalaby, and Hao Shen. All leaves and excesses are realizable for </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >k </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >= 3 and all </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >»</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice, 1990)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 51 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ann. Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 223 228. North-Holland, Amsterdam, 1992. MR1206270 (93j:05033). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[36] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >C. C. Lindner, E. Mendelsohn, and C. A. Rodger. The intersection problem for minimum coverings of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >K</SPAN ><SPAN style="font-size:6.9pt; color:#000000" >n </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >by triples. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Australas. J. Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 4:179 197, 1991. Combinatorial mathematics and combinatorial computing (Palmerston North, 1990).MR1129276 (92k:05039). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[37] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn and N. Shalaby. Skolem labelled graphs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 97(1-3):301 317, 1991. MR1140812 (93k:05165). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[38] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn, Nabil Shalaby, and Hao Shen. Nuclear designs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 32:225 238, 1991. MR1148927 (92j:05042). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[39] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn and N. Shalaby. Decomposing the complement of 3-nets (Latin squares) into triples (a natural generalization of GDDs). </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 30:209 224, 1990. MR1088292 (91m:05044). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[40] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Kevin Phelps, Alexander Rosa, and Eric Mendelsohn. Cyclic Steiner triple systems with cyclic subsystems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >European J. Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 10(4):363 367, 1989. MR1005842 (90d:05042). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[41] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >C. J. Colbourn, E. Mendelsohn, and A. Rosa. Extending the concept of decomposability for triple systems. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Combinatorics 86 (Trento, 1986)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 37 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ann. Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 107 116. North-Holland, Amsterdam, 1988.MR931310 (88m:05013). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[42] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn and Rolf Rees. Mandatory representation designs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Theory Ser. A</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 49(2):349 362, 1988.MR964393 (89i:05050). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[43] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >A. Assaf, E. Mendelsohn, and D. R. Stinson. On resolvable coverings of pairs bytriples. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Utilitas Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 32:67 74, 1987.MR921636 (88k:05043). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[44] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >P. B. Gibbons and E. Mendelsohn. The existence of a subsquare free Latin square of side 12. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >SIAM J. Algebraic Discrete Methods</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 8(1):93 99, 1987. MR872060 (87m:05038). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[45] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn and A. Assaf. On the spectrum of imbrical designs. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Combinatorial design theory</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 149 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >North-Holland Math. Stud.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 363 370. North-Holland, Amsterdam, 1987. MR920660 (88k:05058). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[46] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn, N. S. Mendelsohn, R. Padmanabhan, and Barry Wolk. Decomposition of prime clusters on a complex cubic. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Congr. Numer.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 57:55 61, 1987. Sixteenth Manitoba conference on numerical mathematics and computing (Winnipeg, Man., 1986). MR889705 (88k:51005). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[47] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn and Hao Shen. A construction of resolvable group divisible designs with block size 3. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 24:39 43, 1987. MR917957 (88k:05048). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[48] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Alan Hartman and Eric Mendelsohn. The last of the triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 22:25 41, 1986. MR867730 (88e:05024). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[49] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ahmed Assaf, Alan Hartman, and Eric Mendelsohn. Multiset designs designs having blocks with repeated elements. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Proceedings of the sixteenth Southeastern international conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1985)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 48, pages 7 24, 1985. MR830695 (87e:05033). </SPAN ></P> <P style="margin-bottom:-15px; margin-left:0px; text-indent:0px"> <SPAN style="font-size:9.9pt; color:#000000" >[50] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn. The work of L`</SPAN ></P> <P style="margin-left:215px; text-indent:0px"> <SPAN style="font-size:9.9pt; color:#000000" >u Jia Xi. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Math. Res. Exposition</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 5(3):143 144, 1985. MR842085 (87j:01057). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[51] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn and Alexander Rosa. One-factorizations of the complete graph a survey. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Graph Theory</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 9(1):43 65, 1985.MR785649 (86h:05089). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[52] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >L. D. Andersen and E. Mendelsohn. Embedding Latin squares in Steiner quasigroups, and Howell designs in triple systems. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Convexity and graph theory (Jerusalem, 1981)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 87 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >North-Holland Math. Stud.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 47 54. North-Holland, Amsterdam, 1984.MR791012 (86i:05031). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[55] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn and Alexander Rosa. Embedding maximal packings of triples. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Congr.Numer.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 40:235 247, 1983.MR734373 (85i:05065). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[56] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Lars Døvling Andersen and Eric Mendelsohn. A directconstruction for Latin squares without proper subsquares. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Algebraic and geometric combinatorics</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 65of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >North-Holland Math. Stud.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 27 53. North-Holland, Amsterdam, 1982.MR772581 (85m:05021). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[57] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Charles J. Colbourn and Eric Mendelsohn. Kotzig factorizations: existence and computational results. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Theory and practice of combinatorics</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 60 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >North-Holland Math. Stud.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 65 78. North-Holland, Amsterdam, 1982.MR806970 (86j:05108). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[58] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Charlotte Huang, Eric Mendelsohn, and Alexander Rosa. On partially resolvable </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >t</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >-partitions. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Theory and practice of combinatorics</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 60 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >North-Holland Math. Stud.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 169 183. North-Holland, Amsterdam, 1982.MR806980 (87e:05036). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[59] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn and K. T. Phelps. Simple Steiner quadruple systems. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Algebraic and geometric combinatorics</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 65 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >North-Holland Math. Stud.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 293 304. North-Holland, Amsterdam, 1982. MR772604 (85m:05015). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[60] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn, editor. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Algebraic and geometric combinatorics</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, volume 65 of </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >North-Holland Mathematics Studies</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >. North-Holland Publishing Co., Amsterdam, 1982. Annals of Discrete Mathematics, 15. MR772576 (85k:05002). </SPAN ></P> <P style="margin-bottom:-15px; margin-left:0px; text-indent:0px"> <SPAN style="font-size:9.9pt; color:#000000" >[61] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >S. F(r)</SPAN ></P> <P style="text-indent:25px; line-height:16px"> <SPAN style="font-size:9.9pt; color:#000000" >oldes and E. Mendelsohn. Concrete categories and monoids of relational structures. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Algebra Universalis</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 12(2):145 147, 1981.MR608658 (82j:18006). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[62] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >L. D. Andersen, A. J. W. Hilton, and E. Mendelsohn. Embedding partial Steiner triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Proc. London Math. Soc. (3)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 41(3):557 576, 1980. MR591655 (82a:05010). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[63] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >F. E. Bennett and E. Mendelsohn. Extended (2</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >4)-designs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Theory Ser. A</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 29(1):74 86, 1980. MR577544 (81h:05033). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[64] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >F. E. Bennett, E. Mendelsohn, and N. S. Mendelsohn. Resolvable perfect cyclic designs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin.Theory Ser. A</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 29(2):142 150, 1980. MR583953 (82b:05030). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[65] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn. Perpendicular arrays of triple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ann. Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 7:89 94, 1980. Topics on Steiner systems. MR584406. </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[66] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Charles C. Lindner, E. Mendelsohn, N. S. Mendelsohn, and Barry Wolk. Orthogonal Latin square graphs. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Graph Theory</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 3(4):325 338, 1979. MR549689 (80k:05022). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[67] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn and Alexander Rosa. On some properties of 1-factorizations ofcomplete graphs. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, Congress. Numer., XXIII XXIV, pages 739 752, Winnipeg, Man., 1979. Utilitas Math. MR561094 (81c:05075). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[68] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn. The smallestnon-derived Steiner triple system is simple as a loop. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Algebra Universalis</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 8(2):256  259, 1978.MR0462969 (57 #2934). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[69] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn. Every (ûnite) group is the group of automorphisms of a (ûnite) strongly regular graph. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Ars Combin.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 6:75 86, 1978. MR526092 (81a:05065). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[70] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn. On the groups of automorphisms of Steiner triple and quadruple systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combin. Theory Ser. A</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 25(2):97 104, 1978. MR509435 (80d:05010). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[71] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Charles C. Lindner and Eric Mendelsohn. On the conjugates of an </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >n </SPAN ><SPAN style="font-size:6.9pt; color:#000000" ><Sup>2 </Sup></SPAN ><SPAN style="font-size:9.9pt; color:#000000" >×</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >4 orthogonal array. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Discrete Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 20(2):123 132, 1977/78.MR484066 (80f:05015). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[72] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Charles C. Lindner, Eric Mendelsohn, and Alexander Rosa. On the number of 1-factorizations of the complete graph. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Combinatorial Theory Ser. B</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 20(3):265 282, 1976. MR0491359 (58 #10617). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[73] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn. Every group is the collineation group of some projective plane. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Foundations of geometry (Proc. Conf., Univ. Toronto, Toronto, Ont., 1974)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 175 182. Univ. Toronto Press, Toronto, Ont., 1976. MR0405235 (53 #9029). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[74] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn. On the groups of automorphisms of Steiner triple and quadruple systems. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Proceedings of the Conference on Algebraic Aspects of Combinatorics (Univ. Toronto, Toronto, Ont., 1975)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 255 264. Congressus Numerantium, No. XIII, Winnipeg, Man., 1975. Utilitas Math. MR0384564 (52 #5438). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[75] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >D. Corneil and E. Mendelsohn, editors. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Proceedings of the Conference on Algebraic Aspects of Combinatorics</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >. Utilitas Mathematica Publishing Inc., Winnipeg, Man., 1975. Held at the University of Toronto, Toronto, Ont., January, 1975, Congressus Numerantium, No. XIII. MR0379214 (52 #120). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[76] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Unsolved problems. In </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Proceedings of the Conference on Algebraic Aspects of Combinatorics (Univ. Toronto, Toronto, Ont., 1975)</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, pages 289 296. Congressus Numerantium, No. XIII, Winnipeg, Man., 1975. Utilitas Math. MR0384556 (52 #5430). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[77] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn. Pathological projective planes: associate aûne planes. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >J. Geometry</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 4:161 165, 1974. MR0367802 (51 #4044). </SPAN ></P> <P style="text-indent:0px; line-height:16px"> <SPAN style="font-size:9.9pt; color:#000000" >1971.MR0295996 (45 #5057). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[81] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn. An elementarycharacterization of the categoryof (free)relationalsystems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Math. Z.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 113:224  232, 1970.MR0268106 (42 #3005). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[82] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Z. Hedrl´1n and E. Mendelsohn. The category of graphs with a given subgraph with applications to topology and algebra. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Canad. J. Math.</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 21:1506 1517, 1969. MR0260608 (41 #5232). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[83] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >E. Mendelsohn. An elementary characterization of the category of relational systems. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Comment. Math. Univ. Carolinae</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 10:571 588, 1969. MR0268248 (42 #3147). </SPAN ></P> <P style="text-indent:-26px"> <SPAN style="font-size:9.9pt; color:#000000" >[84] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Eric Mendelsohn and Sidney Spital. Problems and Solutions: Solutions of Elementary Problems: E1992. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Amer. Math. Monthly</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 75(8):900 901, 1968. MR1535057. </SPAN ></P> <P style="margin-left:0px; text-indent:0px"> <SPAN style="font-size:9.9pt; color:#000000" >[85] </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >T. M. K. Davison, Eric Mendelsohn, Joseph Arkin, H. S. Shapiro, R. O. Davies, E. O. Buchman, R. S. Luthar, </SPAN ></P> <P style="text-indent:0px; line-height:16px"> <SPAN style="font-size:9.9pt; color:#000000" >W. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >A. McWorter, V. F. Ivanoû, J. M. Khatri, and A. J. Wiseman. Problems and Solutions: Elementary Problems: E1985-E1994. </SPAN ><SPAN style="font-size:9.9pt; color:#000000" >Amer. Math. Monthly</SPAN ><SPAN style="font-size:9.9pt; color:#000000" >, 74(5):589 591, 1967. MR1534336. </SPAN ></P> <A HREF="http://www.math.utoronto.ca/~mendelso"><FONT SIZE=5><IMG SRC="/gif/ball_B.gif">ack</A> </DIV> </BODY> </HTML>