|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
36 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A density version of the Hales-Jewett theorem for k=3 |
Furstenberg, H. |
1989 |
75 | 1-3 |
p. 227-241 15 p. |
artikel |
|
| 2 | An on-line graph coloring algorithm with sublinear performance ratio |
Lovász, László |
1989 |
75 | 1-3 |
p. 319-325 7 p. |
artikel |
|
| 3 | A note on latin squares with restricted support |
Häggkvist, Roland |
1989 |
75 | 1-3 |
p. 253-254 2 p. |
artikel |
|
| 4 | A short proof of a theorem of vámos on matroid representations |
Leader, Imre |
1989 |
75 | 1-3 |
p. 315-317 3 p. |
artikel |
|
| 5 | A simple linear expected time algorithm for finding a hamilton path |
Thomason, Andrew |
1989 |
75 | 1-3 |
p. 373-379 7 p. |
artikel |
|
| 6 | Author index |
1989 |
75 | 1-3 |
p. 409-410 2 p. |
artikel |
||
| 7 | Bounds on the measurable chromatic number of R n |
Székely, L.A. |
1989 |
75 | 1-3 |
p. 343-372 30 p. |
artikel |
|
| 8 | Bouquets of geometric lattices: some algebraic and topological aspects |
Laurent, Monique |
1989 |
75 | 1-3 |
p. 279-313 35 p. |
artikel |
|
| 9 | Combinatorics 1988 |
1989 |
75 | 1-3 |
p. 405-407 3 p. |
artikel |
||
| 10 | Confluence of some presentations associated with graphs |
Biggs, Norman |
1989 |
75 | 1-3 |
p. 41-46 6 p. |
artikel |
|
| 11 | Covering the complete graph by partitions |
Füredi, Zoltán |
1989 |
75 | 1-3 |
p. 217-226 10 p. |
artikel |
|
| 12 | Dense expanders and pseudo-random bipartite graphs |
Thomason, Andrew |
1989 |
75 | 1-3 |
p. 381-386 6 p. |
artikel |
|
| 13 | Editorial Board |
1989 |
75 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 14 | Extensions of networks with given diameter |
Bermond, J.-C. |
1989 |
75 | 1-3 |
p. 31-40 10 p. |
artikel |
|
| 15 | 1-factorizing regular graphs of high degree—an improved bound |
Chetwynd, A.G. |
1989 |
75 | 1-3 |
p. 103-112 10 p. |
artikel |
|
| 16 | First cycles in random directed graph processes |
Bollobás, Béla |
1989 |
75 | 1-3 |
p. 55-68 14 p. |
artikel |
|
| 17 | Forbidden graphs for degree and neighbourhood conditions |
Woodall, D.R. |
1989 |
75 | 1-3 |
p. 387-404 18 p. |
artikel |
|
| 18 | Graphs with a small number of distinct induced subgraphs |
Alon, Noga |
1989 |
75 | 1-3 |
p. 23-30 8 p. |
artikel |
|
| 19 | Graphs with small bandwidth and cutwidth |
Chung, F.R.K. |
1989 |
75 | 1-3 |
p. 113-119 7 p. |
artikel |
|
| 20 | Long cycles in graphs with no subgraphs of minimal degree 3 |
Bollobás, Béla |
1989 |
75 | 1-3 |
p. 47-53 7 p. |
artikel |
|
| 21 | On clustering problems with connected optima in euclidean spaces |
Boros, Endre |
1989 |
75 | 1-3 |
p. 81-88 8 p. |
artikel |
|
| 22 | On the number of distinct induced subgraphs of a graph |
Erdős, P. |
1989 |
75 | 1-3 |
p. 145-154 10 p. |
artikel |
|
| 23 | On the number of partitions of n without a given subsum (I) |
Erdős, P. |
1989 |
75 | 1-3 |
p. 155-166 12 p. |
artikel |
|
| 24 | On the path-complete bipartite Ramsey number |
Häggkvist, Roland |
1989 |
75 | 1-3 |
p. 243-245 3 p. |
artikel |
|
| 25 | Packing smaller graphs into a graph |
Akiyama, Jin |
1989 |
75 | 1-3 |
p. 7-9 3 p. |
artikel |
|
| 26 | Paul Erdős at seventy-five |
Bollobás, Béla |
1989 |
75 | 1-3 |
p. 3-5 3 p. |
artikel |
|
| 27 | Preface |
1989 |
75 | 1-3 |
p. 1- 1 p. |
artikel |
||
| 28 | Pseudo-random hypergraphs |
Haviland, Julie |
1989 |
75 | 1-3 |
p. 255-278 24 p. |
artikel |
|
| 29 | Scaffold permutations |
Rosenstiehl, P. |
1989 |
75 | 1-3 |
p. 335-342 8 p. |
artikel |
|
| 30 | Simplicial decompositions of graphs: a survey of applications |
Diestel, Reinhard |
1989 |
75 | 1-3 |
p. 121-144 24 p. |
artikel |
|
| 31 | Some sequences of integers |
Cameron, Peter J. |
1989 |
75 | 1-3 |
p. 89-102 14 p. |
artikel |
|
| 32 | The first cycles in an evolving graph |
Flajolet, Philippe |
1989 |
75 | 1-3 |
p. 167-215 49 p. |
artikel |
|
| 33 | The partite construction and ramsey set systems |
Nešetřil, Jaroslav |
1989 |
75 | 1-3 |
p. 327-334 8 p. |
artikel |
|
| 34 | The star arboricity of graphs |
Algor, I. |
1989 |
75 | 1-3 |
p. 11-22 12 p. |
artikel |
|
| 35 | Towards a solution of the dinitz problem? |
Häggkvist, Roland |
1989 |
75 | 1-3 |
p. 247-251 5 p. |
artikel |
|
| 36 | Trigraphs |
Bondy, J.A. |
1989 |
75 | 1-3 |
p. 69-79 11 p. |
artikel |
36 gevonden resultaten