nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An algorithm to recognize a middle graph
|
Skowrońska, Mirosława |
|
1984 |
7 |
2 |
p. 201-208 8 p. |
artikel |
2 |
Announcement
|
|
|
1984 |
7 |
2 |
p. 230- 1 p. |
artikel |
3 |
Book announcements
|
|
|
1984 |
7 |
2 |
p. 227-229 3 p. |
artikel |
4 |
Counting and coding identity trees with fixed diameter and bounded degree
|
Haigh, Claude W. |
|
1984 |
7 |
2 |
p. 141-160 20 p. |
artikel |
5 |
Counting dendrograms: A survey
|
Murtagh, Fionn |
|
1984 |
7 |
2 |
p. 191-199 9 p. |
artikel |
6 |
Domination, independent domination, and duality in strongly chordal graphs
|
Farber, Martin |
|
1984 |
7 |
2 |
p. 115-130 16 p. |
artikel |
7 |
Isometric embedding in products of complete graphs
|
Winkler, Peter M. |
|
1984 |
7 |
2 |
p. 221-225 5 p. |
artikel |
8 |
On the average shape of monotonically labelled tree structures
|
Kirschenhofer, Peter |
|
1984 |
7 |
2 |
p. 161-181 21 p. |
artikel |
9 |
Optimal constructions of reversible digraphs
|
Sysło, Maciej M. |
|
1984 |
7 |
2 |
p. 209-220 12 p. |
artikel |
10 |
Probabilities of dominant candidates based on first-place votes
|
Fishburn, Peter C. |
|
1984 |
7 |
2 |
p. 131-140 10 p. |
artikel |
11 |
Toward optimal gossiping schemes with conference calls
|
Liestman, Arthur L. |
|
1984 |
7 |
2 |
p. 183-189 7 p. |
artikel |