nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A census of regular 3-polystroma arising from honeycombs
|
Colbourn, Charles J. |
|
1984 |
50 |
C |
p. 29-36 8 p. |
artikel |
2 |
A convex characterization of the graphs of the dodecahedron and icosahedron
|
Vanden Cruyce, Patricia |
|
1984 |
50 |
C |
p. 99-105 7 p. |
artikel |
3 |
Adams operations and λ-operations in β-rings
|
Morris, I. |
|
1984 |
50 |
C |
p. 253-270 18 p. |
artikel |
4 |
A generalized closure and complement phenomenon
|
Peleg, D. |
|
1984 |
50 |
C |
p. 285-293 9 p. |
artikel |
5 |
Almost all comparability graphs are UPO
|
Möhring, Rolf H. |
|
1984 |
50 |
C |
p. 63-70 8 p. |
artikel |
6 |
An asymptotic expansion for the coefficients of some power series II: Lagrange inversion
|
Bender, Edward A. |
|
1984 |
50 |
C |
p. 135-141 7 p. |
artikel |
7 |
An exact result for 3-graphs
|
Frankl, P. |
|
1984 |
50 |
C |
p. 323-328 6 p. |
artikel |
8 |
A-optimal design matrices
|
Wong, Chi Song |
|
1984 |
50 |
C |
p. 295-318 24 p. |
artikel |
9 |
A table of connected graphs on six vertices
|
Cvetković, Dragoš |
|
1984 |
50 |
C |
p. 37-49 13 p. |
artikel |
10 |
Author index volume 50 (1984)
|
|
|
1984 |
50 |
C |
p. 331-332 2 p. |
artikel |
11 |
Chromatic number of classes of matrices of zeros and ones
|
Brualdi, Richard A. |
|
1984 |
50 |
C |
p. 143-152 10 p. |
artikel |
12 |
Cycles through k+2 vertices in k-connected graphs
|
Tsikopoulos, N. |
|
1984 |
50 |
C |
p. 113-114 2 p. |
artikel |
13 |
Generalized chromatic polynomials
|
Joyce, David |
|
1984 |
50 |
C |
p. 51-62 12 p. |
artikel |
14 |
Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
|
Calderbank, A.R. |
|
1984 |
50 |
C |
p. 15-28 14 p. |
artikel |
15 |
Independently prescriable sets of n-letter words
|
Dayhoff, Judith E. |
|
1984 |
50 |
C |
p. 193-219 27 p. |
artikel |
16 |
Interval-regular graphs of diameter two
|
Bandelt, Hans-Jürgen |
|
1984 |
50 |
C |
p. 117-134 18 p. |
artikel |
17 |
On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
|
Jendroľ, Stanislav |
|
1984 |
50 |
C |
p. 231-237 7 p. |
artikel |
18 |
On circuits in graphs
|
El-Zahar, Mohamed H. |
|
1984 |
50 |
C |
p. 227-230 4 p. |
artikel |
19 |
On generalized locally testable languages
|
Brzozowski, J.A. |
|
1984 |
50 |
C |
p. 153-169 17 p. |
artikel |
20 |
On log concavity for order-preserving maps of partial orders
|
Daykin, David E. |
|
1984 |
50 |
C |
p. 221-226 6 p. |
artikel |
21 |
On the distribution in a graph process
|
Handa, B.R. |
|
1984 |
50 |
C |
p. 319-322 4 p. |
artikel |
22 |
On the intricacy of combinatorial construction problems
|
Opencomb, W.E. |
|
1984 |
50 |
C |
p. 71-97 27 p. |
artikel |
23 |
On triple-sum-sets and two or three weights codes
|
Courteau, Bernard |
|
1984 |
50 |
C |
p. 179-191 13 p. |
artikel |
24 |
Partitions of multisets II
|
Bender, Edward A. |
|
1984 |
50 |
C |
p. 1-8 8 p. |
artikel |
25 |
Permutations representatives d'un graphe a seuil
|
Arbouz, P. |
|
1984 |
50 |
C |
p. 109-112 4 p. |
artikel |
26 |
Regular factors in nearly regular graphs
|
Bermond, Jean-Claude |
|
1984 |
50 |
C |
p. 9-13 5 p. |
artikel |
27 |
Research problems
|
|
|
1984 |
50 |
C |
p. 115- 1 p. |
artikel |
28 |
Research problems
|
|
|
1984 |
50 |
C |
p. 329- 1 p. |
artikel |
29 |
Sequences of binomial type with polynomial coefficients
|
Niederhausen, H. |
|
1984 |
50 |
C |
p. 271-284 14 p. |
artikel |
30 |
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
|
Burr, Stefan A. |
|
1984 |
50 |
C |
p. 171-177 7 p. |
artikel |
31 |
Structure and recognition of domishold graphs
|
Marchioro, P. |
|
1984 |
50 |
C |
p. 239-251 13 p. |
artikel |
32 |
Transversals of circuits and acyclic orientations in graphs and matroids
|
Berge, C. |
|
1984 |
50 |
C |
p. 107-108 2 p. |
artikel |