G. H. John van Rees

Publication Activity (10 Years)

Years Active: 1975-2013
Publications (10 Years): 0

Top Topics

Social Network Analysis

Hypergraph Model

Higher Order Relations

Top Venues

Australas. J Comb.

Publications

Pak Ching Li, G. H. John van Rees
A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph. Australas. J Comb. 57 (2013)
Pak Ching Li, G. H. John van Rees, Stela Hanbyeol Seo, N. M. Singhi
Friendship 3-hypergraphs. Discret. Math. 312 (11) (2012)
G. H. John van Rees
More greedy defining sets in Latin squares. Australas. J Comb. 44 (2009)
Nicholas J. Cavenagh, Diane M. Donovan, Abdollah Khodkar, G. H. John van Rees
When is a partial Latin square uniquely completable, but not its completable product? Discret. Math. 308 (13) (2008)
D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. John van Rees, Ruizhong Wei
Constructions and bounds for (m, t)-splitting systems. Discret. Math. 307 (1) (2007)
Alan C. H. Ling, Pak Ching Li, G. H. John van Rees
Splitting systems and separating systems. Discret. Math. 279 (1-3) (2004)
John A. Bate, G. H. John van Rees
Minimal and near-minimal critical sets in back-circulant latin squares. Australas. J Comb. 27 (2003)
R. T. Bilous, G. H. John van Rees
An Enumeration of Binary Self-Dual Codes of Length 32. Des. Codes Cryptogr. 26 (1-3) (2002)
Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees
Preface: In Honour of Ronald C. Mullin. Des. Codes Cryptogr. 26 (1-3) (2002)
John A. Bate, G. H. John van Rees
A note on critical sets. Australas. J Comb. 25 (2002)
David A. Drake, G. H. John van Rees, W. D. Wallis
Maximal sets of mutually orthogonal Latin squares. Discret. Math. 194 (1-3) (1999)
Rolf S. Rees, Douglas R. Stinson, Ruizhong Wei, G. H. John van Rees
An application of covering designs: determining the maximum consistent set of shares in a threshold scheme. Ars Comb. 53 (1999)
John A. Bate, G. H. John van Rees
The Size of the Smallest Strong Critical Set in a Latin Square. Ars Comb. 53 (1999)
Ebadollah S. Mahmoodian, G. H. John van Rees
Critical sets in back circulant Latin rectangles. Australas. J Comb. 16 (1997)
William L. Kocay, G. H. John van Rees
Some non-isomorphic (4t + 4, 8t + 6, 4t + 3, 2t + 2, 2t + 1)- BIBD's. Discret. Math. 92 (1-3) (1991)
Gerhard W. Dueck, G. H. John van Rees
On the Maximum Number of Implicants Needed to Cover a Multiple-Valued Logic Function Using Window Literals. ISMVL (1991)
G. H. John van Rees
A new family of BIBDs and non-embeddable (16, 24, 9, 6, 3)-designs. Discret. Math. 77 (1-3) (1989)
Marshall Hall Jr., Robert Roth, G. H. John van Rees, Scott A. Vanstone
On designs (22, 33, 12, 8, 4). J. Comb. Theory, Ser. A 47 (2) (1988)
Douglas R. Stinson, G. H. John van Rees
The equivalence of certain equidistant binary codes and symmetric BIBDs. Comb. 4 (4) (1984)
Andries E. Brouwer, G. H. John van Rees
More mutually orthogonal latin squares. Discret. Math. 39 (3) (1982)
David M. Jackson, G. H. John van Rees
The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices. SIAM J. Comput. 4 (4) (1975)