Donald L. Kreher

Shannon Veitch

Discret. Math., 2020

Block-avoiding point sequencings of directed triple systems.

[BibT_eX]

[DOI]

Shannon Veitch

Discret. Math., 2020

Uniformly resolvable decompositions of Kv in 1-factors and 4-stars.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

2019

On factor-invariant graphs.

[BibT_eX]

[DOI]

Brian Alspach

Afsaneh Khodadadpour

Discret. Math., 2019

Nonsequenceable Steiner triple systems.

[BibT_eX]

[DOI]

Bull. ICA, 2019

Block-avoiding sequencings of points in Steiner triple systems.

[BibT_eX]

[DOI]

Australas. J Comb., 2019

2018

Some new Kirkman signal sets.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

Corrigendum to: A note on nearly platonic graphs.

[BibT_eX]

[DOI]

William J. Keith

Dalibor Froncek

Australas. J Comb., 2018

A note on nearly platonic graphs.

[BibT_eX]

[DOI]

William J. Keith

Dalibor Froncek

Australas. J Comb., 2018

2017

The Friedlander-Gordon-Miller conjecture is true.

[BibT_eX]

[DOI]

Brian Alspach

Adrián Pastine

Australas. J Comb., 2017

2015

A note on the cyclic matching sequencibility of graphs.

[BibT_eX]

[DOI]

Adrián Pastine

Leah Tollefson

Australas. J Comb., 2015

2014

On Reconstructing Graphs and Their Complements.

[BibT_eX]

[DOI]

William L. Kocay

SIAM J. Discret. Math., 2014

f-vectors of pure complexes and pure multicomplexes of rank three.

[BibT_eX]

[DOI]

Melissa S. Keranen

Discret. Math., 2014

2013

Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups.

[BibT_eX]

[DOI]

Brian Alspach

Cafer Çaliskan

Discret. Math., 2013

2009

6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable.

[BibT_eX]

[DOI]

Erik E. Westlund

Jiuqiang Liu

Discret. Math., 2009

On orthogonal generalized equitable rectangles.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

2008

Small Group Divisible Steiner Quadruple Systems.

[BibT_eX]

[DOI]

Artem A. Zhuravlev

Melissa S. Keranen

Electron. J. Comb., 2008

2005

Graphs, algorithms and optimization.

[BibT_eX]

William L. Kocay

Chapman&Hall/CRC Press, ISBN: 978-1-58488-396-8, 2005

2004

Tight incomplete block designs.

[BibT_eX]

[DOI]

Izabela Adamczak

Hans-Dietrich O. F. Gronau

Rolf S. Rees

Discret. Math., 2004

Super-simple (v, 5, 2)-designs.

[BibT_eX]

[DOI]

Alan C. H. Ling

Discret. Appl. Math., 2004

2003

A note on {4}-GDDs of type 210.

[BibT_eX]

[DOI]

Discret. Math., 2003

1999

Combinatorial algorithms: generation, enumeration, and search.

[BibT_eX]

[DOI]

SIGACT News, 1999

Covering Arrays of Strength Three.

[BibT_eX]

[DOI]

M. A. Chateauneuf

Des. Codes Cryptogr., 1999

1996

A family of resolvable regular graph designs.

[BibT_eX]

[DOI]

Gordon F. Royle

W. D. Wallis

Discret. Math., 1996

Concerning Difference Matrices.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1996

1995

Partial Steiner Triple Systems with Equal-Sized Holes.

[BibT_eX]

Charles A. Cusack

J. Comb. Theory A, 1995

A note on spanning trees in near d-angulations.

[BibT_eX]

Michael J. Gilpen

Ars Comb., 1995

The intersection problem for small G-designs.

[BibT_eX]

[DOI]

Elizabeth J. Billington

Australas. J Comb., 1995

1993

The parameters 4-(12, 6, 6) and related t-designs.

[BibT_eX]

[DOI]

Australas. J Comb., 1993

1991

On the covering of t-sets with (t + 1)-sets: C(9, 5, 4) and C(10, 6, 5).

[BibT_eX]

[DOI]

D. de Caen

W. H. Mills

Discret. Math., 1991

1990

Large sets of disjoint t-designs.

[BibT_eX]

[DOI]

Australas. J Comb., 1990

1989

A generalization of Connor's inequality to t-designs with automorphisms.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1989

1988

Search algorithm for Ramsey graphs by union of group orbits.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

1986

The existence of simple 6-(14, 7, 4) designs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

An incidence algebra for t-designs with automorphisms.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

1983

Graphical t-wise balanced designs.

[BibT_eX]

[DOI]

Leo G. Chouinard

Earl S. Kramer