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 AND Volume=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On
v_1\times v_2(n,s,t)
configurations
S.E. Payne
,
M.F. Tinsley
Journal of Combinatorial Theory
7
, 1969, pp. 1-14
On constructing balanced incomplete block designs from association matrices with special reference to association schemes of two and three classes
William C. Blackwelder
Journal of Combinatorial Theory
7
, 1969, pp. 15-36
Uniqueness theorems in balanced incomplete block designs
R.G. Stanton
,
R.C. Mullin
Journal of Combinatorial Theory
7
, 1969, pp. 37-48
The degrees of permutation polynomials over finite fields
Charles Wells
Journal of Combinatorial Theory
7
, 1969, pp. 49-55
A new symmetry of partitions
Freeman J. Dyson
Journal of Combinatorial Theory
7
, 1969, pp. 56-61
W_v
paths on 3-polytopes
David Barnette
Journal of Combinatorial Theory
7
, 1969, pp. 62-70
Solution of the Heawood map-coloring problem-case 11
Gerhard Ringel
,
J.W.T. Youngs
Journal of Combinatorial Theory
7
, 1969, pp. 71-93
A lower bound for the order of a partial transversal in a Latin square
Klaas K. Koksma
Journal of Combinatorial Theory
7
, 1969, pp. 94-95
Bounds for the chromatic number of a graph
J.A. Bondy
Journal of Combinatorial Theory
7
, 1969, pp. 96-98
On
p
-vectors of 3-polytopes
David Barnette
Journal of Combinatorial Theory
7
, 1969, pp. 99-103
A note on
K
-path Hamiltonian graphs
Hudson V. Kronk
Journal of Combinatorial Theory
7
, 1969, pp. 104-106
Packing a rectangle with congruent
N
-ominoes
David A. Klarner
Journal of Combinatorial Theory
7
, 1969, pp. 107-115
On Stirling numbers of the second kind
B.C. Rennie
,
A.J. Dobson
Journal of Combinatorial Theory
7
, 1969, pp. 116-121
On the
p
-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
K.J.C. Smith
Journal of Combinatorial Theory
7
, 1969, pp. 122-129
Balancing equal weights on the integer line
R.E. Odeh
,
E.J. Cockayne
Journal of Combinatorial Theory
7
, 1969, pp. 130-135
Signed distance graphs
Miroslav Fiedler
Journal of Combinatorial Theory
7
, 1969, pp. 136-149
A theorem on
n
-connected graphs
R. Halin
Journal of Combinatorial Theory
7
, 1969, pp. 150-154
Enumeration of polyhedra: The number of 9-hedra
P.J. Federico
Journal of Combinatorial Theory
7
, 1969, pp. 155-161
Enumeration of combinations with restricted differences and cospan
W.O.J. Moser
,
Morton Abramson
Journal of Combinatorial Theory
7
, 1969, pp. 162-170
Generalizations of Terquem's problem
W.O.J. Moser
,
Morton Abramson
Journal of Combinatorial Theory
7
, 1969, pp. 171-180
On subsets contained in a family of non-commensurable subsets of a finite set
Daniel Kleitman
Journal of Combinatorial Theory
7
, 1969, pp. 181-183
On a conjecture of B. Grünbaum
Ivan Havel
Journal of Combinatorial Theory
7
, 1969, pp. 184-186
Enumerating sets with restrictions
Robert Donaghey
Journal of Combinatorial Theory
7
, 1969, pp. 187-188
An interval graph is a comparability graph
Michel Jean
Journal of Combinatorial Theory
7
, 1969, pp. 189-190
On a problem concerning separating systems of a finite set
T.J. Dickson
Journal of Combinatorial Theory
7
, 1969, pp. 191-196
Seiten 1
2
3
>