Charles C. Lindner

According to our database1, Charles C. Lindner authored at least 89 papers between 1972 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Revisiting the intersection problem for minimum coverings of complete graphs with triples.
Australas. J Comb., 2017

2016
Squashing maximum packings of 6-cycles into maximum packings of triples.
Ars Math. Contemp., 2016

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

Almost 2-perfect 6-cycle systems.
Des. Codes Cryptogr., 2015

2013
Simple 2-fold (3<i>n</i>, <i>n</i>, 3)(3n, n, 3) group divisible designs having a prescribed number of triples in common.
Electron. Notes Discret. Math., 2013

Triple metamorphosis of twofold triple systems.
Discret. Math., 2013

Palettes in block colourings of designs.
Australas. J Comb., 2013

2012
Extra two-fold Steiner pentagon systems.
Discret. Math., 2012

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

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

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

Almost resolvable minimum coverings of complete graphs with 4-cycles.
Australas. J Comb., 2011

The triangle intersection problem for nested Steiner triple systems.
Australas. J Comb., 2011

2010
The generalized almost resolvable cycle system problem.
Comb., 2010

2009
Embedding Steiner triple systems in hexagon triple systems.
Discret. Math., 2009

Embeddings of P<sub>3</sub>-designs into bowtie and almost bowtie systems.
Discret. Math., 2009

Embedding 5-cycle systems into pentagon triple systems.
Discret. Math., 2009

On (K<sub>4</sub>, K<sub>4</sub>-e)-Designs.
Ars Comb., 2009

2008
Perfect dexagon triple systems.
Discret. Math., 2008

Preface.
Discret. Math., 2008

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

2005
The Triangle Intersection Problem for Kite Systems.
Ars Comb., 2005

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

Nesting kite and 4-cycle systems.
Australas. J Comb., 2005

Lambda-fold complete graph decompositions into perfect four-triple configurations.
Australas. J Comb., 2005

2004
The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambda<i>K<sub>n</sub></i> with 4-cycles.
Discret. Math., 2004

Perfect hexagon triple systems.
Discret. Math., 2004

Minimum Covering for Hexagon Triple Systems.
Des. Codes Cryptogr., 2004

A partial K<sub>4</sub>-e-design of order n can be embedded in a K<sub>4</sub>-e-design of order at most 8n+16√n+82.
Australas. J Comb., 2004

2003
A Small Embedding for Partial 4-Cycle Systems when the Leave is Small.
J. Autom. Lang. Comb., 2003

A connection between varieties of quasigroups and graph decompositions.
Discret. Math., 2003

A partial 2<i>k</i>-cycle system of order <i>n</i> can be embedded in a 2<i>k</i>-cycle system of order <i>kn</i>+<i>c(k)</i>, <i>k</i>geq3, where <i>c(k)</i> is a quadratic function of <i>k</i>.
Discret. Math., 2003

2002
Embedding partial bipartite directed cycle systems.
Discret. Math., 2002

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

A new small embedding for partial 8-cycle systems.
Australas. J Comb., 2002

2000
The number of 4-cycles in 2-factorizations of <i>K</i><sub>2n</sub> minus a 1-factor.
Discret. Math., 2000

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

A small embedding for large directed even cycle systems.
Australas. J Comb., 1999

1998
Two Doyen-Wilson theorems for maximum packings with triples.
Discret. Math., 1998

The Doyen-Wilson theorem for maximum packings of K<sub>n</sub> with 4-cycles.
Discret. Math., 1998

A small embedding for partial directed 6k-cycle systems.
Australas. J Comb., 1998

1997
On equationally defining extended cycle systems<sup>, </sup>.
Discret. Math., 1997

A small embedding for partial hexagon systems.
Australas. J Comb., 1997

1995
Blocking set preserving embeddings of partial K<sub>4</sub>, -, e designs.
Australas. J Comb., 1995

1994
The spectrum for 2-perfect bowtie systems.
Discret. Math., 1994

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

Corrigendum: The spectrum for 3-perfect 9-cycle systems.
Australas. J Comb., 1993

1992
Support Sizes of Triple Systems.
J. Comb. Theory, Ser. A, 1992

The spectrum for lambda-fold 2-perfect 6-cycle systems.
Eur. J. Comb., 1992

2-perfect m-cycle systems.
Discret. Math., 1992

Further results on large sets of disjoint group-divisible designs.
Discret. Math., 1992

The spectrum for 3-perfect 9-cycle systems.
Australas. J Comb., 1992

1991
The spectrum for 2-perfect 6-cycle systems.
J. Comb. Theory, Ser. A, 1991

Blocking sets in designs with block size four II.
Discret. Math., 1991

The intersection problem for minimum coverings of K<sub>n</sub> by triples.
Australas. J Comb., 1991

2-colouring K<sub>4</sub>-e designs.
Australas. J Comb., 1991

1990
Blocking Sets in Designs with Block Size 4.
Eur. J. Comb., 1990

Small embeddings for partial cycle systems of odd length.
Discret. Math., 1990

How to construct a block design with block size four admitting a blocking set.
Australas. J Comb., 1990

1989
On the construction of odd cycle systems.
J. Graph Theory, 1989

Nesting of cycle systems of odd length.
Discret. Math., 1989

1988
Almost resolvable decompositions of 2<i>K</i><sub><i>n</i></sub> into cycles of odd length.
J. Comb. Theory, Ser. A, 1988

The Construction of Large Sets of Idempotent Quasigroups.
Eur. J. Comb., 1988

Nesting and Almost Resolvability of Pentagon Systems.
Eur. J. Comb., 1988

1987
Construction of large sets of pairwise disjoint transitive triple systems II.
Discret. Math., 1987

1984
On the Number of Mendelsohn and Transitive Triple Systems.
Eur. J. Comb., 1984

Steiner pentagon systems.
Discret. Math., 1984

1983
Construction of Large Sets of Pairwise Disjoint Transitive Triple Systems.
Eur. J. Comb., 1983

1982
Mendelsohn Triple Systems Having a Prescribed Number of Triples in Common.
Eur. J. Comb., 1982

1981
On the Number of Disjoint Mendelsohn Triple Systems.
J. Comb. Theory, Ser. A, 1981

Construction of Steiner quadruple systems having a prescribed number of blocks in common.
Discret. Math., 1981

1980
On the construction of Schroeder quasigroups.
Discret. Math., 1980

1979
Orthogonal latin square graphs.
J. Graph Theory, 1979

Lower Bounds for Maximal Partial Parallel Classes in Steiner Systems.
J. Comb. Theory, Ser. A, 1979

1978
Steiner quadruple systems - a survey.
Discret. Math., 1978

A Note on Partial Parallel Classes in Steiner Systems.
Discret. Math., 1978

1977
A Partial Room Square Can be Embedded in a Room Square.
J. Comb. Theory, Ser. A, 1977

On the conjugates of an n<sup>2</sup> × 4 orthogonal array.
Discret. Math., 1977

1976
A Finite Partial Idempotent Latin Cube Can Be Embedded in a Finite Idempotent Latin Cube.
J. Comb. Theory, Ser. A, 1976

Steiner Quadruple Systems All of Whose Derived Steiner Triple Systems Are Nonisomorphic.
J. Comb. Theory, Ser. A, 1976

Two finite embedding theorems for partial 3-quasigroups.
Discret. Math., 1976

1975
A Partial Steiner Triple System of Order n Can Be Embedded in a Steiner Triple System of Order 6n + 3.
J. Comb. Theory, Ser. A, 1975

Disjoint Finite Partial Steiner Triple Systems Can Be Embedded in Disjoint Finite Steiner Triple Systems.
J. Comb. Theory, Ser. A, 1975

Finite embedding theorems for partial Steiner triple systems.
Discret. Math., 1975

1974
A Simple Construction of Disjoint and Almost Disjoint Steiner Triple Systems.
J. Comb. Theory, Ser. A, 1974

Construction of nonisomorphic reverse steiner quasigroups.
Discret. Math., 1974

1973
Construction of doubly diagonalized orthogonal latin squares.
Discret. Math., 1973

On the construction of cyclic quasigroups.
Discret. Math., 1973

1972
Finite Embedding Theorems for Partial Latin Squares, Quasi-groups, and Loops.
J. Comb. Theory, Ser. A, 1972


  Loading...