Donald A. Preece

Matthew A. Ollis

Bull. ICA, 2017

2012

Obtaining All or Half of Un as 〈 x 〉 x 〈 x+1 〉.

[BibT_eX]

[DOI]

Integers, 2012

2011

Daisy chains with four generators.

[BibT_eX]

[DOI]

Emil R. Vaughan

Australas. J Comb., 2011

2010

Combinatorially fruitful properties of 3.2-1 and 3.2-2 modulo p.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Daisy chains with three generators.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

Half-cycles and chaplets.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

2008

Some I terraces from I power-sequences, n being an odd prime.

[BibT_eX]

[DOI]

Discret. Math., 2008

A general approach to constructing power-sequence terraces for Zn.

[BibT_eX]

[DOI]

Discret. Math., 2008

Some da capo directed power-sequence Zn+1 terraces with n an odd prime power.

[BibT_eX]

[DOI]

Discret. Math., 2008

Zigzag and foxtrot terraces for Zn.

[BibT_eX]

[DOI]

Australas. J Comb., 2008

Daisy chains - a fruitful combinatorial concept.

[BibT_eX]

[DOI]

Australas. J Comb., 2008

2007

On balanced incomplete-block designs with repeated blocks.

[BibT_eX]

[DOI]

Peter Dobcsányi

Leonard H. Soicher

Eur. J. Comb., 2007

2006

Self-dual, not self-polar.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

The seven classes of 5×6 triple arrays.

[BibT_eX]

[DOI]

Walter D. Wallis

Discret. Math., 2005

Some power-sequence terraces for Zpq with as few segments as possible.

[BibT_eX]

[DOI]

Discret. Math., 2005

Paley triple arrays.

[BibT_eX]

[DOI]

Walter D. Wallis

Joseph L. Yucas

Australas. J Comb., 2005

2004

Narcissistic half-and-half power-sequence terraces for Zn with n=pqt.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

Sectionable terraces and the (generalised) Oberwolfach problem.

[BibT_eX]

[DOI]

Matthew A. Ollis

Discret. Math., 2003

Round-dance neighbour designs from terraces.

[BibT_eX]

[DOI]

Rosemary A. Bailey

Matthew A. Ollis

Discret. Math., 2003

Power-sequence terraces for where n is an odd prime power.

[BibT_eX]

[DOI]

Discret. Math., 2003

2001

Nested balanced incomplete block designs.

[BibT_eX]

[DOI]

John P. Morgan

David H. Rees

Discret. Math., 2001

1999

Perfect Graeco-Latin balanced incomplete block designs (pergolas).

[BibT_eX]

[DOI]

David H. Rees

Discret. Math., 1999

Some series of cyclic balanced hyper-graeco-Latin superimpositions of three Youden squares.

[BibT_eX]

[DOI]

Discret. Math., 1999

Tight single-change covering designs with v = 12, K = 4.

[BibT_eX]

[DOI]

Discret. Math., 1999

Some New Infinite Series of Freeman-Youden Rectangles.

[BibT_eX]

Ars Comb., 1999

Double Youden rectangles of sizes p(2p+1) and (p+1)(2p+1).

[BibT_eX]

Ars Comb., 1999

1997

Some 6 × 11 Youden squares and double Youden rectangles.

[BibT_eX]

[DOI]

Discret. Math., 1997

Aspects of complete sets of 9 × 9 pairwise orthogonal latin squares.

[BibT_eX]

[DOI]

P. J. Owens

Discret. Math., 1997

1996

Some new non-cyclic latin squares that have cyclic and Youden properties.

[BibT_eX]

P. J. Owens

Ars Comb., 1996

1995

Graeco-Latin squares with embedded balanced superimpositions of Youden squares.

[BibT_eX]

[DOI]

Discret. Math., 1995

How many 7 × 7 latin squares can be partitioned into Youden squares?

[BibT_eX]

[DOI]

Discret. Math., 1995

Single change neighbor designs.

[BibT_eX]

[DOI]

Robert L. Constable

Thomas Dale Porter

Walter D. Wallis

Australas. J Comb., 1995

1994

Balanced 6 × 6 designs for 4 equally replicated treatments.

[BibT_eX]

[DOI]

Discret. Math., 1994

Double Youden rectangles - an update with examples of size 5x11.

[BibT_eX]

[DOI]

Discret. Math., 1994

1972

Generating Successive Incomplete Blocks with Each Pair of Elements in at Least One Block.

[BibT_eX]

[DOI]

John C. Gower