| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A correspondence between partitions related to generalizations of the Rogers–Ramanujan identities
|
Burge, William H.
|
|
1981
|
34 |
1 |
p. 9-15
7 p.
|
artikel
|
| 2 |
Affinely totally variant subsets of V 3(GF(3))
|
Zhu, L.
|
|
1981
|
34 |
1 |
p. 95-99
5 p.
|
artikel
|
| 3 |
Bipartitional polynomials and their applications in combinatorics and statistics
|
Charalambides, Ch.A.
|
|
1981
|
34 |
1 |
p. 81-84
4 p.
|
artikel
|
| 4 |
Complete subgraphs of the graphs of convex polytopes
|
Gallivan, S.
|
|
1981
|
34 |
1 |
p. 25-29
5 p.
|
artikel
|
| 5 |
Construction of steiner quadruple systems having a prescribed number of blocks in common
|
Gionfriddo, M.
|
|
1981
|
34 |
1 |
p. 31-42
12 p.
|
artikel
|
| 6 |
Construction of symmetric PBIB designs and related results
|
Misra, B.L.
|
|
1981
|
34 |
1 |
p. 85-87
3 p.
|
artikel
|
| 7 |
Contraction theorems in Hamiltonian graph theory
|
Hoede, C.
|
|
1981
|
34 |
1 |
p. 61-67
7 p.
|
artikel
|
| 8 |
Editorial Board
|
|
|
1981
|
34 |
1 |
p. ii-
1 p.
|
artikel
|
| 9 |
Enumeration of words by their number of mistakes
|
Zeilberger, Doron
|
|
1981
|
34 |
1 |
p. 89-91
3 p.
|
artikel
|
| 10 |
Graphs which, with their complements, have certain clique covering numbers
|
Brigham, Robert C.
|
|
1981
|
34 |
1 |
p. 1-7
7 p.
|
artikel
|
| 11 |
How well can a graph be n-colored?
|
Vitányi, Paul M.B.
|
|
1981
|
34 |
1 |
p. 69-80
12 p.
|
artikel
|
| 12 |
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
|
Grötschel, Martin
|
|
1981
|
34 |
1 |
p. 43-59
17 p.
|
artikel
|
| 13 |
Remarks on distance-regular graphs
|
Yoshizawa, Mitsuo
|
|
1981
|
34 |
1 |
p. 93-94
2 p.
|
artikel
|
| 14 |
S-Quasi-symmetry
|
Carmony, Lowell A.
|
|
1981
|
34 |
1 |
p. 17-24
8 p.
|
artikel
|
| 15 |
Symposium on ordered sets
|
|
|
1981
|
34 |
1 |
p. 101-102
2 p.
|
artikel
|
Tijdschrift beschrijving