Charles C. Lindner
Affiliations:- Auburn University, Department of Discrete and Statistical Sciences, AL, USA
According to our database1,
Charles C. Lindner
authored at least 90 papers
between 1972 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on isni.org
On csauthors.net:
Bibliography
2019
2017
Revisiting the intersection problem for minimum coverings of complete graphs with triples.
Australas. J Comb., 2017
2016
Ars Math. Contemp., 2016
2015
Graphs Comb., 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
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
Graphs Comb., 2011
Australas. J Comb., 2011
Australas. J Comb., 2011
2010
2009
Discret. Math., 2009
On (K<sub>4</sub>, K<sub>4</sub>-e)-Designs.
Ars Comb., 2009
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
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
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
J. Autom. Lang. Comb., 2003
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
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
1998
Discret. Math., 1998
1997
1995
Australas. J Comb., 1995
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
1992
Support Sizes of Triple Systems.
J. Comb. Theory A, 1992
Discret. Math., 1992
1991
Australas. J Comb., 1991
1990
Australas. J Comb., 1990
1989
1988
Almost resolvable decompositions of 2<i>K</i><sub><i>n</i></sub> into cycles of odd length.
J. Comb. Theory A, 1988
1987
Discret. Math., 1987
1984
1983
Eur. J. Comb., 1983
1982
Eur. J. Comb., 1982
1981
Construction of Steiner quadruple systems having a prescribed number of blocks in common.
Discret. Math., 1981
1980
1979
J. Comb. Theory A, 1979
1978
1977
1976
A Finite Partial Idempotent Latin Cube Can Be Embedded in a Finite Idempotent Latin Cube.
J. Comb. Theory A, 1976
Steiner Quadruple Systems All of Whose Derived Steiner Triple Systems Are Nonisomorphic.
J. Comb. Theory A, 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 A, 1975
Disjoint Finite Partial Steiner Triple Systems Can Be Embedded in Disjoint Finite Steiner Triple Systems.
J. Comb. Theory A, 1975
1974
J. Comb. Theory A, 1974
1973
1972
J. Comb. Theory A, 1972