nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Brylawski decomposition for finite ordered sets
|
Stanley, Richard P. |
|
1973 |
4 |
1 |
p. 77-82 6 p. |
artikel |
2 |
All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
|
Tabourier, Yves |
|
1973 |
4 |
1 |
p. 83-87 5 p. |
artikel |
3 |
A note on growing binary trees
|
Konheim, Alan G. |
|
1973 |
4 |
1 |
p. 57-63 7 p. |
artikel |
4 |
Corrigendum
|
|
|
1973 |
4 |
1 |
p. 90- 1 p. |
artikel |
5 |
Decompositions of complete graphs into regular bichromatic factors
|
Kotzig, Anton |
|
1973 |
4 |
1 |
p. 65-69 5 p. |
artikel |
6 |
Editorial Board
|
|
|
1973 |
4 |
1 |
p. iii- 1 p. |
artikel |
7 |
Graphs with specified radius and diameter
|
Ostrand, Phillip A. |
|
1973 |
4 |
1 |
p. 71-75 5 p. |
artikel |
8 |
New books
|
|
|
1973 |
4 |
1 |
p. 93-100 8 p. |
artikel |
9 |
On a generalization of Ramsey numbers
|
Erdös, Paul |
|
1973 |
4 |
1 |
p. 29-35 7 p. |
artikel |
10 |
Optimal task sequencing with precedence constraints
|
Garey, M.R. |
|
1973 |
4 |
1 |
p. 37-56 20 p. |
artikel |
11 |
Polytopes de transport symetriques
|
Dubois, Jacques |
|
1973 |
4 |
1 |
p. 1-27 27 p. |
artikel |
12 |
The gossip problem
|
Berman, Gerald |
|
1973 |
4 |
1 |
p. 91- 1 p. |
artikel |
13 |
8th international symposium on mathematical programming, sponsored by the mathematical programming society, August 26–31, 1973, Stanford University, Stanford, Calif. 94305, USA
|
|
|
1973 |
4 |
1 |
p. 89- 1 p. |
artikel |