Eric Mendelsohn - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2017

Zero-sum flows for triple systemsS. Akbari, Andrea C. Burgess, Peter Danziger, Eric Mendelsohn. DM, 340(3):416-425, 2017. [doi]

On the existence of unparalleled even cycle systemsPeter Danziger, Eric Mendelsohn, Tommaso Traetta. ejc, 59:11-22, 2017. [doi]

2016

On generalized Howell designs with block size threeR. Julian R. Abel, Robert F. Bailey, Andrea C. Burgess, Peter Danziger, Eric Mendelsohn. dcc, 81(2):365-391, 2016. [doi]

2010

Chromatically Supremal Decompositions of GraphsRobert E. Jamison, Eric Mendelsohn. gc, 26(3):369-382, 2010. [doi]

2009

The 2-star spectrum of starsRobert A. Beeler, Robert E. Jamison, Eric Mendelsohn. ajc, 45:303-308, 2009. [doi]

n into the union of two 2-pathsPeter Danziger, Eric Mendelsohn, Gaetano Quattrocchi. arscom, 93, 2009.

Covering arrays avoiding forbidden edgesPeter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens. TCS, 410(52):5403-5414, 2009. [doi]

Quasi-embeddings and intersections of latin squares of different ordersPeter Dukes, Eric Mendelsohn. ajc, 43:197-210, 2009. [doi]

2008

Covering Arrays Avoiding Forbidden EdgesPeter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens. cocoa 2008: 296-308 [doi]

2007

On the chromatic spectrum of acyclic decompositions of graphsRobert E. Jamison, Eric Mendelsohn. jgt, 56(2):83-104, 2007. [doi]

2006

On the Intersection Problem for Steiner Triple Systems of Different OrdersPeter Danziger, Peter Dukes, Terry Griggs, Eric Mendelsohn. gc, 22(3):311-329, 2006. [doi]

2004

On the chromatic index of path decompositionsPeter Danziger, Eric Mendelsohn, Gaetano Quattrocchi. DM, 284(1-3):107-121, 2004. [doi]

Minimum embedding of balanced ::::P::::::4::-designs into 5-cycle systemsGaetano Quattrocchi, Eric Mendelsohn. DM, 279(1-3):407-421, 2004. [doi]

Packing arraysBrett Stevens, Eric Mendelsohn. TCS, 321(1):125-148, 2004. [doi]

2003

Bicolour graphs of Steiner triple systemsPeter Danziger, Eric Mendelsohn. DM, 261(1-3):157-176, 2003. [doi]

2002

Packing ArraysBrett Stevens, Eric Mendelsohn. latin 2002: 293-305 [doi]

Packing Arrays and Packing DesignsBrett Stevens, Eric Mendelsohn. dcc, 27(1-2):165-176, 2002.

A direct construction of transversal covers using group divisible designsBrett Stevens, Alan C. H. Ling, Eric Mendelsohn. arscom, 63, 2002.

2000

Colouring Planar Mixed HypergraphsAndré Kündgen, Eric Mendelsohn, Vitaly I. Voloshin. combinatorics, 7, 2000. [doi]

Pancyclicity and NP-completeness in Planar GraphsMing-Chu Li, Derek G. Corneil, Eric Mendelsohn. DAM, 98(3):219-225, 2000. [doi]

Resolving Triple Systems into Regular ConfigurationsEric Mendelsohn, Gaetano Quattrocchi. combinatorics, 7, 2000. [doi]

1999

On defining numbers of vertex colouring of regular graphsEbadollah S. Mahmoodian, Eric Mendelsohn. DM, 197-198:543-554, 1999. [doi]

On Skolem Labelling of WindmillsEric Mendelsohn, Nabil Shalaby. arscom, 53, 1999.

1998

On the complexity of coloring areflexive h-ary relations with given permutation groupL. Haddad, Pavol Hell, Eric Mendelsohn. arscom, 48, 1998.

Efficient software testing protocolsBrett Stevens, Eric Mendelsohn. cascon 1998: 22 [doi]

Lower Bounds for Transversal CoversBrett Stevens, Lucia Moura, Eric Mendelsohn. dcc, 15(3):279-299, 1998.

1997

Triangles in 2-factorizationsItalo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa. jgt, 26(2):83-94, 1997. [doi]

1996

The construction of antipodal triple systems by simulated annealingP. B. Gibbons, Eric Mendelsohn. DM, 155(1-3):59-76, 1996. [doi]

1994

Anti-mitre steiner triple systemsCharles J. Colbourn, Eric Mendelsohn, Alexander Rosa, Jozef Sirán. gc, 10(2-4):215-224, 1994. [doi]

Antipodal triple systemsPeter B. Gibbons, Eric Mendelsohn, Hao Shen. ajc, 9:137-152, 1994. [doi]

The existence of court balanced tournament designsEric Mendelsohn, P. Rodney. DM, 133(1-3):207-216, 1994. [doi]

1992

Concerning Multiplier Automorphisms of Cyclic Steiner Triple SystemsCharles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, Vladimir D. Tonchev. dcc, 2(3):237-251, 1992.

1991

n by triplesC. C. Lindner, Eric Mendelsohn, C. A. Rodger. ajc, 4:179-198, 1991. [doi]

Skolem labelled graphsEric Mendelsohn, Nabil Shalaby. DM, 97(1-3):301-317, 1991. [doi]

1989

Cyclic Steiner Triple Systems with Cyclic SubsystemsKevin T. Phelps, Alexander Rosa, Eric Mendelsohn. ejc, 10(4):363-367, 1989. [doi]

1988

Mandatory representation designsEric Mendelsohn, Rolf S. Rees. JCT, 49(2):349-362, 1988. [doi]

1985

One-factorizations of the complete graph - A surveyEric Mendelsohn, Alexander Rosa. jgt, 9(1):43-65, 1985. [doi]

1980

Resolvable Perfect Cyclic DesignsFrank E. Bennett, Eric Mendelsohn, N. S. Mendelsohn. JCT, 29(2):142-150, 1980.

Extended (2, 4)-DesignsFrank E. Bennett, Eric Mendelsohn. JCT, 29(1):74-86, 1980.

1979

Orthogonal latin square graphsCharles C. Lindner, Eric Mendelsohn, Nathan Saul Mendelsohn, Barry Wolk. jgt, 3(4):325-338, 1979. [doi]

1978

On the Groups of Automorphisms of Steiner Triple and Quadruple SystemsEric Mendelsohn. JCT, 25(2):97-104, 1978.

1977

2 × 4 orthogonal arrayCharles C. Lindner, Eric Mendelsohn. DM, 20:123-132, 1977. [doi]

Sign in or sign up to see more results.

runs on WebDSL