|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
29 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A combinatorial interpretation of the recurrence f n+1 = 6f n − f n−1 |
Barcucci, E. |
1998 |
190 | 1-3 |
p. 235-240 6 p. |
artikel |
|
| 2 | Acyclic graphoidal covers and path partitions in a graph |
Arumugam, S. |
1998 |
190 | 1-3 |
p. 67-77 11 p. |
artikel |
|
| 3 | A D-optimal design of order 150 |
Holzmann, W.H. |
1998 |
190 | 1-3 |
p. 265-269 5 p. |
artikel |
|
| 4 | An algorithm for the Tutte polynomials of graphs of bounded treewidth |
Andrzejak, Artur |
1998 |
190 | 1-3 |
p. 39-54 16 p. |
artikel |
|
| 5 | An extremal result on convex lattice polygons |
Alarcon, Eberth |
1998 |
190 | 1-3 |
p. 227-234 8 p. |
artikel |
|
| 6 | Author index to volume 190 (1998) |
1998 |
190 | 1-3 |
p. 299-300 2 p. |
artikel |
||
| 7 | Choosability of K 5-minor-free graphs |
Sˇkrekovski, Riste |
1998 |
190 | 1-3 |
p. 223-226 4 p. |
artikel |
|
| 8 | Chromatic Ramsey numbers |
Zhu, Xuding |
1998 |
190 | 1-3 |
p. 215-222 8 p. |
artikel |
|
| 9 | Completeness for intersection classes |
Moorhouse, Timothy B. |
1998 |
190 | 1-3 |
p. 277-286 10 p. |
artikel |
|
| 10 | Edge colorings of graphs embeddable in a surface of low genus |
Hind, Hugh |
1998 |
190 | 1-3 |
p. 107-114 8 p. |
artikel |
|
| 11 | Editorial Board |
1998 |
190 | 1-3 |
p. v-vii nvt p. |
artikel |
||
| 12 | Finitary bases and formal generating functions |
Mulay, S.B. |
1998 |
190 | 1-3 |
p. 177-189 13 p. |
artikel |
|
| 13 | Forcing matchings on square grids |
Pachter, Lior |
1998 |
190 | 1-3 |
p. 287-294 8 p. |
artikel |
|
| 14 | Graph partitions with minimum degree constraints |
Arkin, Esther M. |
1998 |
190 | 1-3 |
p. 55-65 11 p. |
artikel |
|
| 15 | Irregularity strength of trees |
Amar, D. |
1998 |
190 | 1-3 |
p. 15-38 24 p. |
artikel |
|
| 16 | On a problem concerning ordered colourings |
Caccetta, Louis |
1998 |
190 | 1-3 |
p. 241-245 5 p. |
artikel |
|
| 17 | On binary k-paving matroids and Reed-Muller codes |
Rajpal, Sanjay |
1998 |
190 | 1-3 |
p. 191-200 10 p. |
artikel |
|
| 18 | On optimal orientations of cartesian products of graphs (I) |
Koh, K.M. |
1998 |
190 | 1-3 |
p. 115-136 22 p. |
artikel |
|
| 19 | On the structure of a random sum-free set of positive integers |
Calkin, Neil J. |
1998 |
190 | 1-3 |
p. 247-257 11 p. |
artikel |
|
| 20 | Optimally pebbling hypercubes and powers |
Moews, David |
1998 |
190 | 1-3 |
p. 271-276 6 p. |
artikel |
|
| 21 | Permutations, parenthesis words, and Schröder numbers |
Ehrenfeucht, A. |
1998 |
190 | 1-3 |
p. 259-264 6 p. |
artikel |
|
| 22 | Sign-balanced covering matrices |
Godbole, Anant P. |
1998 |
190 | 1-3 |
p. 79-93 15 p. |
artikel |
|
| 23 | The boundary characteristic and the volume of lattice polyhedra |
Kołodziejczyk, Krzysztof |
1998 |
190 | 1-3 |
p. 137-148 12 p. |
artikel |
|
| 24 | The existence of perfect Mendelsohn designs with block size 7 |
Abel, R.J.R. |
1998 |
190 | 1-3 |
p. 1-14 14 p. |
artikel |
|
| 25 | The extremal codes of length 42 with automorphism of order 7 |
Yorgov, Vassil |
1998 |
190 | 1-3 |
p. 201-213 13 p. |
artikel |
|
| 26 | The toughness of split graphs |
Woeginger, Gerhard J. |
1998 |
190 | 1-3 |
p. 295-297 3 p. |
artikel |
|
| 27 | Tree-visibility orders |
Kratsch, Dieter |
1998 |
190 | 1-3 |
p. 163-175 13 p. |
artikel |
|
| 28 | Triangular embeddings of K n −K m with unboundedly large m |
Korzhik, Vladimir P. |
1998 |
190 | 1-3 |
p. 149-162 14 p. |
artikel |
|
| 29 | Upper domination and upper irredundance perfect graphs |
Gutin, Gregory |
1998 |
190 | 1-3 |
p. 95-105 11 p. |
artikel |
29 gevonden resultaten