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: Journal=J. Comb.~Theory Series A AND Volume=83
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A bijective census of nonseparable planar maps
Benjamin Jacquard
,
Gilles Schaeffer
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 1-20
Monomial flocks and herds containing a monomial oval
Tim Penttila
,
L. Storme
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 21-41
Characterization of certain minimal rank designs
Gary McGuire
,
Harold N. Ward
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 42-56
Circular numbers and
n
-set partitions
Daniel N. Port
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 57-78
Divisibility of codes meeting the Griesmer bound
Harold N. Ward
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 79-93
Group divisible designs with two associate classes:
n=2
or
m=2
H.L. Fu
,
C.A. Rodger
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 94-117
On the diameter of a Cayley graph of a simple group of Lie type based on a conjugacy class
R. Lawther
,
Martin W. Liebeck
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 118-137
A simple proof of a theorem of Milner
Gyula O.H. Katona
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 138-140
An upper bound theorem for rational polytopes
Margaret M. Bayer
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 141-145
A geometric proof of the gap theorem
David S. Herscovici
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 146-151
New designs with block size 7
Zvonimir Janko
,
Vladimir D. Tonchev
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 152-157
Tiling a square with eight congruent polyominoes
Michael Reid
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 158-158
Factoring the Poincaré polynomials for the Bruhat order on
S_n
Vesselin Gasharov
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 159-164
Finite doubly transitive affine planes
Vikram Jha
,
Norman L. Johnson
Journal of Combinatorial Theory Series A
83
(1), 1998, pp. 165-168
Reconstructing subsets of
Z_n
A.J. Radcliffe
,
A.D. Scott
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 169-187
The size of the largest antichain in the partition lattice
E. Rodney Canfield
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 188-201
A bijection for partitions with all ranks at least
t
Sylvie Corteel
,
Carla D. Savage
,
Radhika Venkatraman
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 202-220
On the generation of dual polar spaces of symplectic type over finite fields
B.N. Cooperstein
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 221-232
Optimal linear perfect hash families
Simon R. Blackburn
,
Peter R. Wild
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 233-250
On the number of solutions of a linear equation over finite sets
Vsevolod F. Lev
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 251-267
Enumeration of Lozenge tilings of punctured hexagons
Mihai Ciucu
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 268-272
Covering graphs: The covering problem solved
Yair Caro
,
Raphael Yuster
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 273-282
Inequalities for the crank
A. Bülent Ekin
Journal of Combinatorial Theory Series A
83
(2), 1998, pp. 283-289