Charles C. Lindner

,

,

Sibel Özkan

,

Australas. J Comb., 2019

Revisiting the intersection problem for minimum coverings of complete graphs with triples.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2017

Squashing maximum packings of 6-cycles into maximum packings of triples.

[BibT_eX]

[DOI]

,

Giovanni Lo Faro

,

Antoinette Tripodi

Ars Math. Contemp., 2016

Intersection Problem for Simple 2-fold (3n, n, 3) Group Divisible Designs.

[BibT_eX]

[DOI]

Fatih Demirkale

,

Diane M. Donovan

,

Graphs Comb., 2015

Almost 2-perfect 6-cycle systems.

[BibT_eX]

[DOI]

,

,

Des. Codes Cryptogr., 2015

Simple 2-fold (3n, n, 3)(3n, n, 3) group divisible designs having a prescribed number of triples in common.

[BibT_eX]

[DOI]

Fatih Demirkale

,

Diane M. Donovan

,

Electron. Notes Discret. Math., 2013

Triple metamorphosis of twofold triple systems.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2013

Palettes in block colourings of designs.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2013

Extra two-fold Steiner pentagon systems.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

The full metamorphosis of λ-fold block designs with block size four into λ-fold triple systems.

[BibT_eX]

,

,

Ars Comb., 2012

The full metamorphosis of λ-fold block designs with block size four into λ-fold 4-cycle systems.

[BibT_eX]

,

,

Ars Comb., 2012

Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles.

[BibT_eX]

[DOI]

,

Italo J. Dejter

,

,

Graphs Comb., 2011

Almost resolvable minimum coverings of complete graphs with 4-cycles.

[BibT_eX]

[DOI]

,

,

,

Australas. J Comb., 2011

The triangle intersection problem for nested Steiner triple systems.

[BibT_eX]

[DOI]

,

,

,

,

Australas. J Comb., 2011

The generalized almost resolvable cycle system problem.

[BibT_eX]

[DOI]

,

,

,

Comb., 2010

Embedding Steiner triple systems in hexagon triple systems.

[BibT_eX]

[DOI]

,

Gaetano Quattrocchi

,

Discret. Math., 2009

Embeddings of P3-designs into bowtie and almost bowtie systems.

[BibT_eX]

[DOI]

,

,

Gaetano Quattrocchi

Discret. Math., 2009

Embedding 5-cycle systems into pentagon triple systems.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

On (K4, K4-e)-Designs.

[BibT_eX]

,

,

Ars Comb., 2009

Perfect dexagon triple systems.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Preface.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9.

[BibT_eX]

,

,

Ars Comb., 2006

The Triangle Intersection Problem for Kite Systems.

[BibT_eX]

,

Ars Comb., 2005

The Metamorphosis of K4\e Designs Into Maximum Packings Of Kn With 4-Cycles.

[BibT_eX]

,

Antoinette Tripodi

Ars Comb., 2005

Nesting kite and 4-cycle systems.

[BibT_eX]

[DOI]

Lucia Gionfriddo

,

Australas. J Comb., 2005

Lambda-fold complete graph decompositions into perfect four-triple configurations.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2005

The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambdaKn with 4-cycles.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2004

Perfect hexagon triple systems.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Minimum Covering for Hexagon Triple Systems.

[BibT_eX]

[DOI]

,

Des. Codes Cryptogr., 2004

A partial K4-e-design of order n can be embedded in a K4-e-design of order at most 8n+16√n+82.

[BibT_eX]

[DOI]

D. G. Hoffman

,

Australas. J Comb., 2004

A Small Embedding for Partial 4-Cycle Systems when the Leave is Small.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

A connection between varieties of quasigroups and graph decompositions.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn+c(k), kgeq3, where c(k) is a quadratic function of k.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2003

Embedding partial bipartite directed cycle systems.

[BibT_eX]

[DOI]

,

Lorenzo Milazzo

Discret. Math., 2002

Completing the spectrum of 2-chromatic S(2, 4, v).

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2002

A new small embedding for partial 8-cycle systems.

[BibT_eX]

[DOI]

Australas. J Comb., 2002

The number of 4-cycles in 2-factorizations of K2n minus a 1-factor.

[BibT_eX]

[DOI]

,

,

Italo J. Dejter

,

Discret. Math., 2000

Monogamous decompositions of complete bipartite graphs, symmetric H-squares, and self-orthogonal 1-factorizations.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1999

A small embedding for large directed even cycle systems.

[BibT_eX]

[DOI]

,

Maria Flavia Mammana

Australas. J Comb., 1999

Two Doyen-Wilson theorems for maximum packings with triples.

[BibT_eX]

[DOI]

H. L. Fu

,

,

Discret. Math., 1998

The Doyen-Wilson theorem for maximum packings of Kn with 4-cycles.

[BibT_eX]

[DOI]

H. L. Fu

,

Discret. Math., 1998

A small embedding for partial directed 6k-cycle systems.

[BibT_eX]

[DOI]

Maria Flavia Mammana

,

Australas. J Comb., 1998

On equationally defining extended cycle systems, .

[BibT_eX]

[DOI]

,

Discret. Math., 1997

A small embedding for partial hexagon systems.

[BibT_eX]

[DOI]

Australas. J Comb., 1997

Blocking set preserving embeddings of partial K4, -, e designs.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1995

The spectrum for 2-perfect bowtie systems.

[BibT_eX]

[DOI]

,

Discret. Math., 1994

A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m.

[BibT_eX]

[DOI]

,

Discret. Math., 1993

Corrigendum: The spectrum for 3-perfect 9-cycle systems.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 1993

Support Sizes of Triple Systems.

[BibT_eX]

Charles J. Colbourn

,

J. Comb. Theory, Ser. A, 1992

The spectrum for lambda-fold 2-perfect 6-cycle systems.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1992

2-perfect m-cycle systems.

[BibT_eX]

[DOI]

,

Discret. Math., 1992

Further results on large sets of disjoint group-divisible designs.

[BibT_eX]

[DOI]

D. Chen

,

,

Discret. Math., 1992

The spectrum for 3-perfect 9-cycle systems.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 1992

The spectrum for 2-perfect 6-cycle systems.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory, Ser. A, 1991

Blocking sets in designs with block size four II.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1991

The intersection problem for minimum coverings of Kn by triples.

[BibT_eX]

[DOI]

,

Eric Mendelsohn

,

Australas. J Comb., 1991

2-colouring K4-e designs.

[BibT_eX]

[DOI]

Mario Gionfriddo

,

,

Australas. J Comb., 1991

Blocking Sets in Designs with Block Size 4.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 1990

Small embeddings for partial cycle systems of odd length.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1990

How to construct a block design with block size four admitting a blocking set.

[BibT_eX]

[DOI]

Australas. J Comb., 1990

On the construction of odd cycle systems.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 1989

Nesting of cycle systems of odd length.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1989

Almost resolvable decompositions of 2Kn into cycles of odd length.

[BibT_eX]

[DOI]

Katherine Heinrich

,

,

J. Comb. Theory, Ser. A, 1988

The Construction of Large Sets of Idempotent Quasigroups.

[BibT_eX]

[DOI]

Luc Teirlinck

,

Eur. J. Comb., 1988

Nesting and Almost Resolvability of Pentagon Systems.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1988

Construction of large sets of pairwise disjoint transitive triple systems II.

[BibT_eX]

[DOI]

Discret. Math., 1987

On the Number of Mendelsohn and Transitive Triple Systems.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1984

Steiner pentagon systems.

[BibT_eX]

[DOI]

,

Discret. Math., 1984

Construction of Large Sets of Pairwise Disjoint Transitive Triple Systems.

[BibT_eX]

[DOI]

,

Anne Penfold Street

Eur. J. Comb., 1983

Mendelsohn Triple Systems Having a Prescribed Number of Triples in Common.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1982

On the Number of Disjoint Mendelsohn Triple Systems.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1981

Construction of Steiner quadruple systems having a prescribed number of blocks in common.

[BibT_eX]

[DOI]

Mario Gionfriddo

,

Discret. Math., 1981

On the construction of Schroeder quasigroups.

[BibT_eX]

[DOI]

,

N. S. Mendelsohn

,

S. R. Sun

Discret. Math., 1980

Orthogonal latin square graphs.

[BibT_eX]

[DOI]

,

Eric Mendelsohn

,

Nathan Saul Mendelsohn

,

Barry Wolk

J. Graph Theory, 1979

Lower Bounds for Maximal Partial Parallel Classes in Steiner Systems.

[BibT_eX]

[DOI]

Ronald C. Mullin

,

J. Comb. Theory, Ser. A, 1979

Steiner quadruple systems - a survey.

[BibT_eX]

[DOI]

,

Discret. Math., 1978

A Note on Partial Parallel Classes in Steiner Systems.

[BibT_eX]

[DOI]

,

Discret. Math., 1978

A Partial Room Square Can be Embedded in a Room Square.

[BibT_eX]

[DOI]

,

J. Comb. Theory, Ser. A, 1977

On the conjugates of an n2 × 4 orthogonal array.

[BibT_eX]

[DOI]

,

Eric Mendelsohn

Discret. Math., 1977

A Finite Partial Idempotent Latin Cube Can Be Embedded in a Finite Idempotent Latin Cube.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1976

Steiner Quadruple Systems All of Whose Derived Steiner Triple Systems Are Nonisomorphic.

[BibT_eX]

[DOI]

,

J. Comb. Theory, Ser. A, 1976

Two finite embedding theorems for partial 3-quasigroups.

[BibT_eX]

[DOI]

Discret. Math., 1976

A Partial Steiner Triple System of Order n Can Be Embedded in a Steiner Triple System of Order 6n + 3.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1975

Disjoint Finite Partial Steiner Triple Systems Can Be Embedded in Disjoint Finite Steiner Triple Systems.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1975

Finite embedding theorems for partial Steiner triple systems.

[BibT_eX]

[DOI]

,

Discret. Math., 1975

A Simple Construction of Disjoint and Almost Disjoint Steiner Triple Systems.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1974

Construction of nonisomorphic reverse steiner quasigroups.

[BibT_eX]

[DOI]

Discret. Math., 1974

Construction of doubly diagonalized orthogonal latin squares.

[BibT_eX]

[DOI]

Discret. Math., 1973

On the construction of cyclic quasigroups.

[BibT_eX]

[DOI]

Discret. Math., 1973

Finite Embedding Theorems for Partial Latin Squares, Quasi-groups, and Loops.

[BibT_eX]

[DOI]