Publications by E.Mendelsohn Reviewed in Math Reviews

[1] Peter Dukes and Eric Mendelsohn. Quasi-embeddings of Steiner triple systems, or Steiner triple systems of different orders with maximum intersection. J. Combin. Des., 13(2):120–138, 2005. MR2116196 (2005h:05025).

[2] Peter Danziger, Eric Mendelsohn, and Gaetano Quattrocchi. On the chromatic index of path decompositions. Discrete Math., 284(1-3):107–121, 2004. MR2071901 (2005g:05051).

[3] Gaetano Quattrocchi and Eric Mendelsohn. Minimum embedding of balanced P4-designs into 5-cycle systems. Discrete Math., 279(1-3):407–421, 2004. In honour of Zhu Lie. MR2060004 (2005a:05034).

[4] Brett Stevens and Eric Mendelsohn. Packing arrays. Theoret. Comput. Sci., 321(1):125–148, 2004. MR2069326 (2005g:05038).

[5] Peter Danziger and Eric Mendelsohn. Bicolour graphs of Steiner triple systems. Discrete Math., 261(1-3):157– 176, 2003. Papers on the occasion of the 65th birthday of Alex Rosa. MR1961744 (2004a:05022).

[6] E. Mendelsohn, M. Meszka, and A. Rosa. Packing Petersen graphs into K10. Bull. Inst. Combin. Appl., 39:85–86, 2003.MR1999861 (2004f:05146).

[7] Brett Stevens, Alan Ling, and Eric Mendelsohn. A directconstruction oftransversalcovers using group divisible designs. Ars Combin., 63:145–159, 2002. MR1898223 (2002m:05039).

[8] Brett Stevens and Eric Mendelsohn. Packingarrays and packing designs. Des. Codes Cryptogr., 27(1-2):165–176, 2002. Special issue in honour of Ronald C. Mullin, Part II. MR1923402 (2003h:05053).

[9] Brett Stevens and Eric Mendelsohn. Packingarrays. In LATIN 2002: Theoretical informatics (Cancun), volume 2286 of Lecture Notes in Comput. Sci., pages 293–305. Springer, Berlin, 2002. MR1966130.

[10] Andr´e K(爩

undgen, Eric Mendelsohn, and Vitaly Voloshin. Colouring planar mixed hypergraphs. Electron. J. Combin., 7:Research Paper 60, 13 pp. (electronic), 2000. MR1799072 (2002g:05085).

[11] Ming-Chu Li, Derek G. Corneil, and Eric Mendelsohn. Pancyclicity and NP-completeness in planar graphs. Discrete Appl. Math., 98(3):219–225, 2000. MR1733672 (2000i:68153).

[12] E. Mendelsohn and G. Quattrocchi. Resolving triple systems into regular configurations. Electron. J. Combin., 7:Research Paper 2, 18 pp. (electronic), 2000.MR1736718 (2000k:05049).

[13] Eric Mendelsohn and Bridget S. Webb. Orbits on cycles of automorphisms. Util. Math., 58:33–44, 2000. MR1801300 (2001k:05035).

[14] P. Dukes and E. Mendelsohn. Skew-orthogonal Steiner triple systems. J. Combin. Des., 7(6):431–440, 1999. MR1711885 (2001d:05021).

[15] E. S. Mahmoodian and E. Mendelsohn. On defining numbers of vertex colouring of regular graphs. Discrete Math., 197/198:543–554, 1999. 16th British Combinatorial Conference (London, 1997). MR1674887 (99i:05085).

[16] E. Mendelsohn and N. Shalaby. On Skolem labelling of windmills. Ars Combin., 53:161–172, 1999. MR1724498 (2000h:05191).

[17] Brett Stevens and Eric Mendelsohn. New recursive methods for transversal covers. J. Combin. Des., 7(3):185– 203, 1999.MR1681504 (2000a:05053).

[18] L. Haddad, P. Hell, and E. Mendelsohn. On the complexity of coloring areflexive h-ary relations with given permutation group. Ars Combin., 48:111–128, 1998. MR1622987 (99d:05033).

[19] Brett Stevens, Lucia Moura, and Eric Mendelsohn. Lower bounds for transversal covers. Des. Codes Cryptogr., 15(3):279–299, 1998.MR1658626 (99m:68144).

[20] P. Danziger and E. Mendelsohn. Intercalates everywhere. In Geometry, combinatorial designs and related structures (Spetses, 1996), volume 245 of London Math. Soc. Lecture Note Ser., pages 69–88. Cambridge Univ. Press, Cambridge, 1997.MR1700841 (2000g:05035).

[21] I. J. Dejter, F. Franek, E. Mendelsohn, and A. Rosa. Triangles in 2-factorizations. J. Graph Theory, 26(2):83–94, 1997.MR1469355 (98e:05086).

[22] E. S. Mahmoodian and E. Mendelsohn. On the defining numbers of vertex coloring of regular graphs. In Proceedings of the 28th Annual Iranian Mathematics Conference, Part 1 (Tabriz, 1997), volume 377 of Tabriz Univ. Ser., pages 327–330. Tabriz Univ., Tabriz, 1997. MR1625325 (99c:05067).

[23] Eric Mendelsohn and Alexander Rosa. Ubiquitous configurations in Steiner triple systems. J. Combin.Des., 5(1):13–31, 1997.MR1421247 (97h:05026).

[24] P. Danziger, E. Mendelsohn, M. J. Grannell, and T. S. Griggs. Five-line configurations in Steiner triple systems. Utilitas Math., 49:153–159, 1996. MR1396296 (97h:05025).

systems. J. Combin. Des., 3(1):51 59, 1995. MR1305447 (95j:05041).

[28] Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, and Jozef ˇ

Sir´n. Anti-mitre Steiner triple systems. Graphs Combin., 10(3):215–224, 1994. MR1304375 (95j:05040).

[29] Guo-Gang Gao, Eric Mendelsohn, and Hui Shan Zhou. Computing star chromatic number from related graph invariants. J. Combin. Math. Combin. Comput., 16:87–95, 1994. MR1301212 (95j:05091).

[30] P. B. Gibbons, E. Mendelsohn, and H. Shen. Antipodal triple systems. Australas. J. Combin., 9:137–151, 1994. MR1271197 (95b:05031).

[31] Terry S. Griggs, Eric Mendelsohn, and Alexander Rosa. Simultaneous decompositions of Steiner triple systems. Ars Combin., 37:157–173, 1994. MR1282554 (95d:05023).

[32] E. Mendelsohn and P. Rodney. The existence of court balanced tournament designs. Discrete Math., 133(1-3):207–216, 1994.MR1298975 (95g:05018).

[33]

aclav Linek and Eric Mendelsohn. 3-(v, 4, 1) covering designs with chromatic numbers 2 and 3. J. Combin. Des., 1(6):411–434, 1993. MR1303953 (95k:05018).

[34] Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, and Vladimir D. Tonchev. Concerning multiplier automorphisms ofcyclic Steiner triple systems. Des. Codes Cryptogr., 2(3):237–251, 1992. MR1181731 (93g:05020).

[35] Eric Mendelsohn, Nabil Shalaby, and Hao Shen. All leaves and excesses are realizable for k = 3 and all λ. In Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice, 1990), volume 51 of Ann. Discrete Math., pages 223–228. North-Holland, Amsterdam, 1992. MR1206270 (93j:05033).

[36] C. C. Lindner, E. Mendelsohn, and C. A. Rodger. The intersection problem for minimum coverings of Kn by triples. Australas. J. Combin., 4:179–197, 1991. Combinatorial mathematics and combinatorial computing (Palmerston North, 1990).MR1129276 (92k:05039).

[37] E. Mendelsohn and N. Shalaby. Skolem labelled graphs. Discrete Math., 97(1-3):301–317, 1991. MR1140812 (93k:05165).

[38] Eric Mendelsohn, Nabil Shalaby, and Hao Shen. Nuclear designs. Ars Combin., 32:225–238, 1991. MR1148927 (92j:05042).

[39] E. Mendelsohn and N. Shalaby. Decomposing the complement of 3-nets (Latin squares) into triples (a natural generalization of GDDs). Ars Combin., 30:209–224, 1990. MR1088292 (91m:05044).

[40] Kevin Phelps, Alexander Rosa, and Eric Mendelsohn. Cyclic Steiner triple systems with cyclic subsystems. European J. Combin., 10(4):363–367, 1989. MR1005842 (90d:05042).

[41] C. J. Colbourn, E. Mendelsohn, and A. Rosa. Extending the concept of decomposability for triple systems. In Combinatorics ’86 (Trento, 1986), volume 37 of Ann. Discrete Math., pages 107–116. North-Holland, Amsterdam, 1988.MR931310 (88m:05013).

[42] Eric Mendelsohn and Rolf Rees. Mandatory representation designs. J. Combin. Theory Ser. A, 49(2):349–362, 1988.MR964393 (89i:05050).

[43] A. Assaf, E. Mendelsohn, and D. R. Stinson. On resolvable coverings of pairs bytriples. Utilitas Math., 32:67–74, 1987.MR921636 (88k:05043).

[44] P. B. Gibbons and E. Mendelsohn. The existence of a subsquare free Latin square of side 12. SIAM J. Algebraic Discrete Methods, 8(1):93–99, 1987. MR872060 (87m:05038).

[45] E. Mendelsohn and A. Assaf. On the spectrum of imbrical designs. In Combinatorial design theory, volume 149 of North-Holland Math. Stud., pages 363–370. North-Holland, Amsterdam, 1987. MR920660 (88k:05058).

[46] E. Mendelsohn, N. S. Mendelsohn, R. Padmanabhan, and Barry Wolk. Decomposition of prime clusters on a complex cubic. Congr. Numer., 57:55–61, 1987. Sixteenth Manitoba conference on numerical mathematics and computing (Winnipeg, Man., 1986). MR889705 (88k:51005).

[47] Eric Mendelsohn and Hao Shen. A construction of resolvable group divisible designs with block size 3. Ars Combin., 24:39–43, 1987. MR917957 (88k:05048).

[48] Alan Hartman and Eric Mendelsohn. The last of the triple systems. Ars Combin., 22:25–41, 1986. MR867730 (88e:05024).

[49] Ahmed Assaf, Alan Hartman, and Eric Mendelsohn. Multiset designs—designs having blocks with repeated elements. In Proceedings of the sixteenth Southeastern international conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1985), volume 48, pages 7–24, 1985. MR830695 (87e:05033).

[50] Eric Mendelsohn. The work of L`

u Jia Xi. J. Math. Res. Exposition, 5(3):143–144, 1985. MR842085 (87j:01057).

[51] Eric Mendelsohn and Alexander Rosa. One-factorizations of the complete graph—a survey. J. Graph Theory, 9(1):43–65, 1985.MR785649 (86h:05089).

[52] L. D. Andersen and E. Mendelsohn. Embedding Latin squares in Steiner quasigroups, and Howell designs in triple systems. In Convexity and graph theory (Jerusalem, 1981), volume 87 of North-Holland Math. Stud., pages 47–54. North-Holland, Amsterdam, 1984.MR791012 (86i:05031).

[55] Eric Mendelsohn and Alexander Rosa. Embedding maximal packings of triples. Congr.Numer., 40:235 247, 1983.MR734373 (85i:05065).

[56] Lars Døvling Andersen and Eric Mendelsohn. A directconstruction for Latin squares without proper subsquares. In Algebraic and geometric combinatorics, volume 65of North-Holland Math. Stud., pages 27–53. North-Holland, Amsterdam, 1982.MR772581 (85m:05021).

[57] Charles J. Colbourn and Eric Mendelsohn. Kotzig factorizations: existence and computational results. In Theory and practice of combinatorics, volume 60 of North-Holland Math. Stud., pages 65–78. North-Holland, Amsterdam, 1982.MR806970 (86j:05108).

[58] Charlotte Huang, Eric Mendelsohn, and Alexander Rosa. On partially resolvable t-partitions. In Theory and practice of combinatorics, volume 60 of North-Holland Math. Stud., pages 169–183. North-Holland, Amsterdam, 1982.MR806980 (87e:05036).

[59] E. Mendelsohn and K. T. Phelps. Simple Steiner quadruple systems. In Algebraic and geometric combinatorics, volume 65 of North-Holland Math. Stud., pages 293–304. North-Holland, Amsterdam, 1982. MR772604 (85m:05015).

[60] Eric Mendelsohn, editor. Algebraic and geometric combinatorics, volume 65 of North-Holland Mathematics Studies. North-Holland Publishing Co., Amsterdam, 1982. Annals of Discrete Mathematics, 15. MR772576 (85k:05002).

[61] S. F(爩

oldes and E. Mendelsohn. Concrete categories and monoids of relational structures. Algebra Universalis, 12(2):145–147, 1981.MR608658 (82j:18006).

[62] L. D. Andersen, A. J. W. Hilton, and E. Mendelsohn. Embedding partial Steiner triple systems. Proc. London Math. Soc. (3), 41(3):557–576, 1980. MR591655 (82a:05010).

[63] F. E. Bennett and E. Mendelsohn. Extended (2, 4)-designs. J. Combin. Theory Ser. A, 29(1):74–86, 1980. MR577544 (81h:05033).

[64] F. E. Bennett, E. Mendelsohn, and N. S. Mendelsohn. Resolvable perfect cyclic designs. J. Combin.Theory Ser. A, 29(2):142–150, 1980. MR583953 (82b:05030).

[65] E. Mendelsohn. Perpendicular arrays of triple systems. Ann. Discrete Math., 7:89–94, 1980. Topics on Steiner systems. MR584406.

[66] Charles C. Lindner, E. Mendelsohn, N. S. Mendelsohn, and Barry Wolk. Orthogonal Latin square graphs. J. Graph Theory, 3(4):325–338, 1979. MR549689 (80k:05022).

[67] Eric Mendelsohn and Alexander Rosa. On some properties of 1-factorizations ofcomplete graphs. In Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979), Congress. Numer., XXIII–XXIV, pages 739–752, Winnipeg, Man., 1979. Utilitas Math. MR561094 (81c:05075).

[68] E. Mendelsohn. The smallestnon-derived Steiner triple system is simple as a loop. Algebra Universalis, 8(2):256– 259, 1978.MR0462969 (57 #2934).

[69] E. Mendelsohn. Every (finite) group is the group of automorphisms of a (finite) strongly regular graph. Ars Combin., 6:75–86, 1978. MR526092 (81a:05065).

[70] Eric Mendelsohn. On the groups of automorphisms of Steiner triple and quadruple systems. J. Combin. Theory Ser. A, 25(2):97–104, 1978. MR509435 (80d:05010).

[71] Charles C. Lindner and Eric Mendelsohn. On the conjugates of an n 2 ×4 orthogonal array. Discrete Math., 20(2):123–132, 1977/78.MR484066 (80f:05015).

[72] Charles C. Lindner, Eric Mendelsohn, and Alexander Rosa. On the number of 1-factorizations of the complete graph. J. Combinatorial Theory Ser. B, 20(3):265–282, 1976. MR0491359 (58 #10617).

[73] E. Mendelsohn. Every group is the collineation group of some projective plane. In Foundations of geometry (Proc. Conf., Univ. Toronto, Toronto, Ont., 1974), pages 175–182. Univ. Toronto Press, Toronto, Ont., 1976. MR0405235 (53 #9029).

[74] Eric Mendelsohn. On the groups of automorphisms of Steiner triple and quadruple systems. In Proceedings of the Conference on Algebraic Aspects of Combinatorics (Univ. Toronto, Toronto, Ont., 1975), pages 255–264. Congressus Numerantium, No. XIII, Winnipeg, Man., 1975. Utilitas Math. MR0384564 (52 #5438).

[75] D. Corneil and E. Mendelsohn, editors. Proceedings of the Conference on Algebraic Aspects of Combinatorics. Utilitas Mathematica Publishing Inc., Winnipeg, Man., 1975. Held at the University of Toronto, Toronto, Ont., January, 1975, Congressus Numerantium, No. XIII. MR0379214 (52 #120).

[76] Unsolved problems. In Proceedings of the Conference on Algebraic Aspects of Combinatorics (Univ. Toronto, Toronto, Ont., 1975), pages 289–296. Congressus Numerantium, No. XIII, Winnipeg, Man., 1975. Utilitas Math. MR0384556 (52 #5430).

[77] E. Mendelsohn. Pathological projective planes: associate affine planes. J. Geometry, 4:161–165, 1974. MR0367802 (51 #4044).

1971.MR0295996 (45 #5057).

[81] Eric Mendelsohn. An elementarycharacterization of the categoryof (free)relationalsystems. Math. Z., 113:224– 232, 1970.MR0268106 (42 #3005).

[82] Z. Hedrl´ın and E. Mendelsohn. The category of graphs with a given subgraph—with applications to topology and algebra. Canad. J. Math., 21:1506–1517, 1969. MR0260608 (41 #5232).

[83] E. Mendelsohn. An elementary characterization of the category of relational systems. Comment. Math. Univ. Carolinae, 10:571–588, 1969. MR0268248 (42 #3147).

[84] Eric Mendelsohn and Sidney Spital. Problems and Solutions: Solutions of Elementary Problems: E1992. Amer. Math. Monthly, 75(8):900–901, 1968. MR1535057.

[85] T. M. K. Davison, Eric Mendelsohn, Joseph Arkin, H. S. Shapiro, R. O. Davies, E. O. Buchman, R. S. Luthar,

W. A. McWorter, V. F. Ivanoff, J. M. Khatri, and A. J. Wiseman. Problems and Solutions: Elementary Problems: E1985-E1994. Amer. Math. Monthly, 74(5):589–591, 1967. MR1534336.

ack