Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Lindner, C.C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Almost resolvable maximum packings of complete graphs with 4-cycles
Elizabeth J. Billington
,
Italo J. Dejter
,
D.G. Hoffman
,
C.C. Lindner
Graphs and Combinatorics
27
(2), 2011, pp. 161-170
The generalized almost resolvable cycle system problem
Peter Adams
,
Elizabeth J. Billington
,
D.G. Hoffman
,
C.C. Lindner
Combinatorica
30
(6), 2010, pp. 617-625
A partial
m = (2k + 1)
-cycle system of order
n
can be embedded in an
m
-cycle system of order
(2n + 1)m
C.C. Lindner
,
C.A. Rodger
Discrete Mathematics
117
(1-3), 1993, pp. 151-159
The spectrum for 2-perfect 6-cycle systems
C.C. Lindner
,
K.T. Phelps
,
C.A. Rodger
Journal of Combinatorial Theory Series A
57
, 1991, pp. 76-85
On the construction of odd cycle systems
D.G. Hoffman
,
C.C. Lindner
,
C.A. Rodger
Journal of Graph Theory
13
(4), 1989, pp. 417-426
Almost resolvable decompositions of
2K_n
into cycles of odd length
Katherine Heinrich
,
C.C. Lindner
,
C.A. Rodger
Journal of Combinatorial Theory Series A
49
, 1988, pp. 218-232
On the number of disjoint Mendelsohn triple systems
C.C. Lindner
Journal of Combinatorial Theory Series A
30
, 1981, pp. 326-330
Lower bounds for maximal partial parallel classes in Steiner systems
R.C. Mullin
,
C.C. Lindner
Journal of Combinatorial Theory Series A
26
, 1979, pp. 314-318