Walter D. Wallis

Discret. Appl. Math., 2014

2008

On the anomalous behaviour of a class of locality statistics.

[BibT_eX]

[DOI]

Carey E. Priebe

Discret. Math., 2008

Strong edge-magic graphs of maximum size.

[BibT_eX]

[DOI]

Jim A. MacDougall

Discret. Math., 2008

Bimagic Labelings.

[BibT_eX]

Alison Marr

Nick Phillips

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2007

Closed-neighbourhood anti-Sperner graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2007

2006

Using graph diameter for change detection in dynamic networks.

[BibT_eX]

[DOI]

Matthew E. Gaston

Miro Kraetzl

Australas. J Comb., 2006

2005

The seven classes of 5×6 triple arrays.

[BibT_eX]

[DOI]

Donald A. Preece

Discret. Math., 2005

Double Arrays, Triple Arrays and Balanced Grids.

[BibT_eX]

[DOI]

John P. McSorley

Des. Codes Cryptogr., 2005

On totally magic injections.

[BibT_eX]

[DOI]

R. A. Yates

Australas. J Comb., 2005

Paley triple arrays.

[BibT_eX]

[DOI]

Donald A. Preece

Australas. J Comb., 2005

2003

On constant-weight TSP-tours.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2003

Vertex-magic labeling of trees and forests.

[BibT_eX]

[DOI]

Discret. Math., 2003

Vertex-Magic Total Labelings of Complete Bipartite Graphs.

[BibT_eX]

Ars Comb., 2003

Strong edge-magic labelling of a cycle with a chord.

[BibT_eX]

[DOI]

Jim A. MacDougall

Australas. J Comb., 2003

2002

Detection of Abnormal Change in a Time Series of Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2002

Factoring the cartesian product of a cubic graph and a triangle.

[BibT_eX]

[DOI]

Joseph Douglas Horton

Discret. Math., 2002

Totally magic graphs.

[BibT_eX]

[DOI]

Geoffrey Exoo

Alan C. H. Ling

John P. McSorley

Discret. Math., 2002

2001

Graph distances using graph union.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2001

Packings and coverings of v=3m+1 points with near-triangle factors.

[BibT_eX]

[DOI]

Rolf S. Rees

Australas. J Comb., 2001

2000

Survey of certain valuations of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2000

Edge-magic total labelings.

[BibT_eX]

[DOI]

Australas. J Comb., 2000

1999

Maximal sets of mutually orthogonal Latin squares.

[BibT_eX]

[DOI]

David A. Drake

G. H. John van Rees

Discret. Math., 1999

The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares.

[BibT_eX]

Beiliang Du

Ars Comb., 1999

1998

Skew-Hadamard Matrices and the Smith Normal Form.

[BibT_eX]

[DOI]

T. S. Michael

Des. Codes Cryptogr., 1998

Minimum Order of a Graph with Given Deficiency and Either Minimum or Maximum Degree.

[BibT_eX]

Purwanto

Ars Comb., 1998

1997

Kirkman's school projects.

[BibT_eX]

[DOI]

Anton Cerný

Peter Horák

Discret. Math., 1997

Counting frequencies of configurations in Steiner Triple Systems.

[BibT_eX]

Peter Horák

Ars Comb., 1997

1996

Perfect double covers with paths of length four.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

A family of resolvable regular graph designs.

[BibT_eX]

[DOI]

Donald L. Kreher

Gordon F. Royle

Discret. Math., 1996

1995

Squares, clique graphs, and chordality.

[BibT_eX]

[DOI]

Julin Wu

J. Graph Theory, 1995

On the spectrum on maximal k-multiple free sets of integers.

[BibT_eX]

Wan-Di Wei

Ars Comb., 1995

Symmetric and skew equivalence of Hadamard matrices of order 28.

[BibT_eX]

A. H. Baartmans

Cantian Lin

Ars Comb., 1995

Single change neighbor designs.

[BibT_eX]

[DOI]

Robert L. Constable

Donald A. Preece

Thomas Dale Porter

Australas. J Comb., 1995

1994

Maximal sets of triangle- factors.

[BibT_eX]

[DOI]

Rolf S. Rees

Alexander Rosa

Australas. J Comb., 1994

1993

On the partition and coloring of a graph by cliques.

[BibT_eX]

[DOI]

Guo-Hui Zhang

Discret. Math., 1993

Single Change Covering Designs.

[BibT_eX]

[DOI]

Guo-Hui Zhang

Des. Codes Cryptogr., 1993

Cubic Arcs in Cubic Nets.

[BibT_eX]

[DOI]

Vassili C. Mavron

Des. Codes Cryptogr., 1993

Note on the parameters of balanced designs.

[BibT_eX]

[DOI]

Australas. J Comb., 1993

1992

A geometric construction of the Steiner system S(4, 7, 23).

[BibT_eX]

[DOI]

Alphonse Baartmans

Discret. Math., 1992

1991

On clique partitions of split graphs.

[BibT_eX]

[DOI]

Julin Wu

Discret. Math., 1991

The spectrum of maximal sets of one-factors.

[BibT_eX]

[DOI]

Rolf S. Rees

Discret. Math., 1991

1990

Generalized clique coverings of chordal graphs.

[BibT_eX]

[DOI]

Julin Wu

Australas. J Comb., 1990

Not all perfect extrinsic secret sharing schemes are ideal.

[BibT_eX]

[DOI]

Australas. J Comb., 1990

1989

Indecomposable factorizations of multigraphs.

[BibT_eX]

[DOI]

A. H. Baartmans

Discret. Math., 1989

1986

Clique partitions of the cocktail party graph.

[BibT_eX]

[DOI]

David A. Gregory

Sean McGuinness

Discret. Math., 1986

1984

On one-factorizations of compositions of graphs.

[BibT_eX]

[DOI]

P. Himelwright

J. E. Williamson

J. Graph Theory, 1984

1983

Two-fold triple systems without repeated blocks.

[BibT_eX]

[DOI]

Douglas R. Stinson

Discret. Math., 1983

Room squares with holes of sides 3, 5, and 7.

[BibT_eX]

[DOI]

Jeffrey H. Dinitz

Douglas R. Stinson

Discret. Math., 1983

1982

Premature sets of 1-factors or how not to schedule round robin tournaments.

[BibT_eX]

[DOI]

Alexander Rosa

Discret. Appl. Math., 1982

Asymptotic values of clique partition numbers.

[BibT_eX]

[DOI]

Comb., 1982

1981

On the existence of frames.

[BibT_eX]

[DOI]

Discret. Math., 1981

1978

Graphs with symmetric automorphism group.

[BibT_eX]

[DOI]

Katherine Heinrich

J. Graph Theory, 1978

1974

Solution of the Room Square Existence Problem.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1974

1973

Room Squares with Sub-squares.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1973

Configurations Arising from Maximal Arcs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1973

1972

A doubling construction for room squares.

[BibT_eX]

[DOI]