On the conjugates of an n2 × 4 orthogonal array. - Charles C. Lindner; Eric Mendelsohn (Discret. Math., 1977)

On the Groups of Automorphisms of Steiner Triple and Quadruple Systems. - Eric Mendelsohn (J. Comb. Theory A, 1978)

Orthogonal latin square graphs. - Charles C. Lindner; Eric Mendelsohn; Nathan Saul Mendelsohn; Barry Wolk (J. Graph Theory, 1979)

Extended (2, 4)-Designs. - Frank E. Bennett; Eric Mendelsohn (J. Comb. Theory A, 1980)

Resolvable Perfect Cyclic Designs. - Frank E. Bennett; Eric Mendelsohn; N. S. Mendelsohn (J. Comb. Theory A, 1980)

One-factorizations of the complete graph - A survey. - Eric Mendelsohn; Alexander Rosa (J. Graph Theory, 1985)

Mandatory representation designs. - Eric Mendelsohn; Rolf S. Rees (J. Comb. Theory A, 1988)

Cyclic Steiner Triple Systems with Cyclic Subsystems. - Kevin T. Phelps; Alexander Rosa; Eric Mendelsohn (Eur. J. Comb., 1989)

The intersection problem for minimum coverings of Kn by triples. - Charles C. Lindner; Eric Mendelsohn; C. A. Rodger (Australas. J Comb., 1991)

Skolem labelled graphs. - Eric Mendelsohn; Nabil Shalaby (Discret. Math., 1991)

Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. - Charles J. Colbourn; Eric Mendelsohn; Cheryl E. Praeger; Vladimir D. Tonchev (Des. Codes Cryptogr., 1992)

Antipodal triple systems. - Peter B. Gibbons; Eric Mendelsohn; Hao Shen (Australas. J Comb., 1994)

The existence of court balanced tournament designs. - Eric Mendelsohn; P. Rodney (Discret. Math., 1994)

Anti-mitre steiner triple systems. - Charles J. Colbourn; Eric Mendelsohn; Alexander Rosa; Jozef Sirán (Graphs Comb., 1994)

The construction of antipodal triple systems by simulated annealing. - Peter B. Gibbons; Eric Mendelsohn (Discret. Math., 1996)

Triangles in 2-factorizations. - Italo J. Dejter; Frantisek Franek; Eric Mendelsohn; Alexander Rosa (J. Graph Theory, 1997)

Efficient software testing protocols. - Brett Stevens; Eric Mendelsohn (CASCON, 1998)

On the complexity of coloring areflexive h-ary relations with given permutation group. - L. Haddad; Pavol Hell; Eric Mendelsohn (Ars Comb., 1998)

Lower Bounds for Transversal Covers. - Brett Stevens; Lucia Moura; Eric Mendelsohn (Des. Codes Cryptogr., 1998)

On Skolem Labelling of Windmills. - Eric Mendelsohn; Nabil Shalaby (Ars Comb., 1999)

On defining numbers of vertex colouring of regular graphs. - Ebadollah S. Mahmoodian; Eric Mendelsohn (Discret. Math., 1999)

Colouring Planar Mixed Hypergraphs. - André Kündgen; Eric Mendelsohn; Vitaly I. Voloshin (Electron. J. Comb., 2000)

Resolving Triple Systems into Regular Configurations. - Eric Mendelsohn; Gaetano Quattrocchi (Electron. J. Comb., 2000)

Pancyclicity and NP-completeness in Planar Graphs. - Mingchu Li; Derek G. Corneil; Eric Mendelsohn (Discret. Appl. Math., 2000)

A direct construction of transversal covers using group divisible designs. - Brett Stevens; Alan C. H. Ling; Eric Mendelsohn (Ars Comb., 2002)

Packing Arrays and Packing Designs. - Brett Stevens; Eric Mendelsohn (Des. Codes Cryptogr., 2002)

Bicolour graphs of Steiner triple systems. - Peter Danziger; Eric Mendelsohn (Discret. Math., 2003)

On the chromatic index of path decompositions. - Peter Danziger; Eric Mendelsohn; Gaetano Quattrocchi (Discret. Math., 2004)

Minimum embedding of balanced P4-designs into 5-cycle systems. - Gaetano Quattrocchi; Eric Mendelsohn (Discret. Math., 2004)

Packing arrays. - Brett Stevens; Eric Mendelsohn (Theor. Comput. Sci., 2004)

On the Intersection Problem for Steiner Triple Systems of Different Orders. - Peter Danziger; Peter Dukes; Terry S. Griggs; Eric Mendelsohn (Graphs Comb., 2006)

On the chromatic spectrum of acyclic decompositions of graphs. - Robert E. Jamison; Eric Mendelsohn (J. Graph Theory, 2007)

The 2-star spectrum of stars. - Robert A. Beeler; Robert E. Jamison; Eric Mendelsohn (Australas. J Comb., 2009)

Quasi-embeddings and intersections of latin squares of different orders. - Peter Dukes; Eric Mendelsohn (Australas. J Comb., 2009)

Resolvable decompositions of λKn into the union of two 2-paths. - Peter Danziger; Eric Mendelsohn; Gaetano Quattrocchi (Ars Comb., 2009)

Covering arrays avoiding forbidden edges. - Peter Danziger; Eric Mendelsohn; Lucia Moura; Brett Stevens (Theor. Comput. Sci., 2009)

Chromatically Supremal Decompositions of Graphs. - Robert E. Jamison; Eric Mendelsohn (Graphs Comb., 2010)

On generalized Howell designs with block size three. - R. Julian R. Abel; Robert F. Bailey; Andrea C. Burgess; Peter Danziger; Eric Mendelsohn (Des. Codes Cryptogr., 2016)

Zero-sum flows for triple systems. - Saieed Akbari; Andrea C. Burgess; Peter Danziger; Eric Mendelsohn (Discret. Math., 2017)

On the existence of unparalleled even cycle systems. - Peter Danziger; Eric Mendelsohn; Tommaso Traetta (Eur. J. Comb., 2017)

On the minisymposium problem. - Peter Danziger; Eric Mendelsohn; Brett Stevens; Tommaso Traetta (Ars Math. Contemp., 2024)