Eric Mendelsohn

Orcid: 0000-0002-2711-8995

According to our database1, Eric Mendelsohn authored at least 40 papers between 1977 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
On the existence of unparalleled even cycle systems.
Eur. J. Comb., 2017

Zero-sum flows for triple systems.
Discret. Math., 2017

2016
On generalized Howell designs with block size three.
Des. Codes Cryptogr., 2016

2010
Chromatically Supremal Decompositions of Graphs.
Graphs Comb., 2010

2009
Covering arrays avoiding forbidden edges.
Theor. Comput. Sci., 2009

Resolvable decompositions of λK<sub>n</sub> into the union of two 2-paths.
Ars Comb., 2009

Quasi-embeddings and intersections of latin squares of different orders.
Australas. J Comb., 2009

The 2-star spectrum of stars.
Australas. J Comb., 2009

2007
On the chromatic spectrum of acyclic decompositions of graphs.
J. Graph Theory, 2007

2006
On the Intersection Problem for Steiner Triple Systems of Different Orders.
Graphs Comb., 2006

2004
Packing arrays.
Theor. Comput. Sci., 2004

Minimum embedding of balanced <i>P</i><sub>4</sub>-designs into 5-cycle systems.
Discret. Math., 2004

On the chromatic index of path decompositions.
Discret. Math., 2004

2003
Bicolour graphs of Steiner triple systems.
Discret. Math., 2003

2002
Packing Arrays and Packing Designs.
Des. Codes Cryptogr., 2002

A direct construction of transversal covers using group divisible designs.
Ars Comb., 2002

2000
Pancyclicity and NP-completeness in Planar Graphs.
Discret. Appl. Math., 2000

Resolving Triple Systems into Regular Configurations.
Electron. J. Comb., 2000

Colouring Planar Mixed Hypergraphs.
Electron. J. Comb., 2000

1999
On defining numbers of vertex colouring of regular graphs.
Discret. Math., 1999

On Skolem Labelling of Windmills.
Ars Comb., 1999

1998
Lower Bounds for Transversal Covers.
Des. Codes Cryptogr., 1998

On the complexity of coloring areflexive h-ary relations with given permutation group.
Ars Comb., 1998

Efficient software testing protocols.
Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative Research, November 30, 1998

1997
Triangles in 2-factorizations.
J. Graph Theory, 1997

1996
The construction of antipodal triple systems by simulated annealing.
Discret. Math., 1996

1994
Anti-mitre steiner triple systems.
Graphs Comb., 1994

The existence of court balanced tournament designs.
Discret. Math., 1994

Antipodal triple systems.
Australas. J Comb., 1994

1992
Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems.
Des. Codes Cryptogr., 1992

1991
Skolem labelled graphs.
Discret. Math., 1991

The intersection problem for minimum coverings of K<sub>n</sub> by triples.
Australas. J Comb., 1991

1989
Cyclic Steiner Triple Systems with Cyclic Subsystems.
Eur. J. Comb., 1989

1988
Mandatory representation designs.
J. Comb. Theory A, 1988

1985
One-factorizations of the complete graph - A survey.
J. Graph Theory, 1985

1980
Resolvable Perfect Cyclic Designs.
J. Comb. Theory A, 1980

Extended (2, 4)-Designs.
J. Comb. Theory A, 1980

1979
Orthogonal latin square graphs.
J. Graph Theory, 1979

1978
On the Groups of Automorphisms of Steiner Triple and Quadruple Systems.
J. Comb. Theory A, 1978

1977
On the conjugates of an n<sup>2</sup> × 4 orthogonal array.
Discret. Math., 1977


  Loading...