G. H. John van Rees

According to our database, G. H. John van Rees authored at least 21 papers between 1975 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2013

A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph.

Pak Ching Li, G. H. John van Rees

Australas. J Comb., 2013

2012

Friendship 3-hypergraphs.

Pak Ching Li, G. H. John van Rees, Stela Hanbyeol Seo, N. M. Singhi

Discret. Math., 2012

2009

More greedy defining sets in Latin squares.

G. H. John van Rees

Australas. J Comb., 2009

2008

When is a partial Latin square uniquely completable, but not its completable product?

Nicholas J. Cavenagh, Diane M. Donovan, Abdollah Khodkar, G. H. John van Rees

Discret. Math., 2008

2007

Constructions and bounds for (m, t)-splitting systems.

D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. John van Rees, Ruizhong Wei

Discret. Math., 2007

2004

Splitting systems and separating systems.

Alan C. H. Ling, Pak Ching Li, G. H. John van Rees

Discret. Math., 2004

2003

Minimal and near-minimal critical sets in back-circulant latin squares.

John A. Bate, G. H. John van Rees

Australas. J Comb., 2003

2002

Preface: In Honour of Ronald C. Mullin.

Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees

Des. Codes Cryptogr., 2002

An Enumeration of Binary Self-Dual Codes of Length 32.

R. T. Bilous, G. H. John van Rees

Des. Codes Cryptogr., 2002

A note on critical sets.

John A. Bate, G. H. John van Rees

Australas. J Comb., 2002

1999

Maximal sets of mutually orthogonal Latin squares.

David A. Drake, G. H. John van Rees, W. D. Wallis

Discret. Math., 1999

An application of covering designs: determining the maximum consistent set of shares in a threshold scheme.

Rolf S. Rees, Douglas R. Stinson, Ruizhong Wei, G. H. John van Rees

Ars Comb., 1999

The Size of the Smallest Strong Critical Set in a Latin Square.

John A. Bate, G. H. John van Rees

Ars Comb., 1999

1997

Critical sets in back circulant Latin rectangles.

Ebadollah S. Mahmoodian, G. H. John van Rees

Australas. J Comb., 1997

1991

Some non-isomorphic (4t + 4, 8t + 6, 4t + 3, 2t + 2, 2t + 1)- BIBD's.

William L. Kocay, G. H. John van Rees

Discret. Math., 1991

On the Maximum Number of Implicants Needed to Cover a Multiple-Valued Logic Function Using Window Literals.

Gerhard W. Dueck, G. H. John van Rees

Proceedings of the 21st International Symposium on Multiple-Valued Logic, 1991

1989

A new family of BIBDs and non-embeddable (16, 24, 9, 6, 3)-designs.

G. H. John van Rees

Discret. Math., 1989

1988

On designs (22, 33, 12, 8, 4).

Marshall Hall Jr., Robert Roth, G. H. John van Rees, Scott A. Vanstone

J. Comb. Theory A, 1988

1984

The equivalence of certain equidistant binary codes and symmetric BIBDs.

Douglas R. Stinson, G. H. John van Rees

Comb., 1984

1982

More mutually orthogonal latin squares.

Andries E. Brouwer, G. H. John van Rees

Discret. Math., 1982

1975

The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices.

David M. Jackson, G. H. John van Rees

SIAM J. Comput., 1975