|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
38 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A bound for multicolor Ramsey numbers |
Shi, Ling-sheng |
2001 |
226 | 1-3 |
p. 419-421 3 p. |
artikel |
|
| 2 | All odd musquashes are standard |
Cairns, Grant |
2001 |
226 | 1-3 |
p. 71-91 21 p. |
artikel |
|
| 3 | A note on ascending subgraph decompositions of complete multipartite graphs |
Fu, Hung-Lin |
2001 |
226 | 1-3 |
p. 397-402 6 p. |
artikel |
|
| 4 | Area of Catalan paths |
Woan, Wen-jin |
2001 |
226 | 1-3 |
p. 439-444 6 p. |
artikel |
|
| 5 | A typical vertex of a tree |
Wei, Ping-Hong |
2001 |
226 | 1-3 |
p. 337-345 9 p. |
artikel |
|
| 6 | Boundary graphs: The limit case of a spectral property |
Fiol, M.A. |
2001 |
226 | 1-3 |
p. 155-173 19 p. |
artikel |
|
| 7 | Classical arcs in PG(r,q) for 23⩽q⩽29 |
Chao, J.M. |
2001 |
226 | 1-3 |
p. 377-385 9 p. |
artikel |
|
| 8 | Coloring t-dimensional m-Boxes |
Agnarsson, Geir |
2001 |
226 | 1-3 |
p. 21-33 13 p. |
artikel |
|
| 9 | Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum |
Knopfmacher, Arnold |
2001 |
226 | 1-3 |
p. 255-267 13 p. |
artikel |
|
| 10 | De Bruijn sequences with efficient decoding algorithms |
Tuliani, Jonathan |
2001 |
226 | 1-3 |
p. 313-336 24 p. |
artikel |
|
| 11 | Diameter of the NEPS of bipartite graphs |
Brualdi, Richard A. |
2001 |
226 | 1-3 |
p. 373-376 4 p. |
artikel |
|
| 12 | Digraphs of degree two which miss the Moore bound by two |
Miller, Mirka |
2001 |
226 | 1-3 |
p. 269-280 12 p. |
artikel |
|
| 13 | Discrete, sequential dynamical systems |
Mortveit, H.S. |
2001 |
226 | 1-3 |
p. 281-295 15 p. |
artikel |
|
| 14 | Fiber-complemented graphs — I: structure and invariant subgraphs |
Chastand, Marc |
2001 |
226 | 1-3 |
p. 107-141 35 p. |
artikel |
|
| 15 | Index |
2001 |
226 | 1-3 |
p. 449-450 2 p. |
artikel |
||
| 16 | Intersecting families of sets, no l containing two common elements |
Katona, Zsolt |
2001 |
226 | 1-3 |
p. 233-241 9 p. |
artikel |
|
| 17 | Monotone paths in edge-ordered sparse graphs |
Roditty, Yehuda |
2001 |
226 | 1-3 |
p. 411-417 7 p. |
artikel |
|
| 18 | New 3-designs from Goethals codes over Z4 |
Helleseth, Tor |
2001 |
226 | 1-3 |
p. 403-409 7 p. |
artikel |
|
| 19 | On characters of Weyl groups |
Adin, Ron M. |
2001 |
226 | 1-3 |
p. 355-358 4 p. |
artikel |
|
| 20 | On generalized constraints and certificates |
Hellerstein, Lisa |
2001 |
226 | 1-3 |
p. 211-232 22 p. |
artikel |
|
| 21 | On orthogonal representations of graphs |
Alekseev, V.E. |
2001 |
226 | 1-3 |
p. 359-363 5 p. |
artikel |
|
| 22 | On quasiabelian Cayley graphs |
Zgrablić, Boris |
2001 |
226 | 1-3 |
p. 445-447 3 p. |
artikel |
|
| 23 | On reconstructing arrangements from their sets of simplices |
Forge, David |
2001 |
226 | 1-3 |
p. 175-190 16 p. |
artikel |
|
| 24 | On the hardness of computing maximum self-reduction sequences |
Kingston, Jeffrey H. |
2001 |
226 | 1-3 |
p. 243-253 11 p. |
artikel |
|
| 25 | On the planarity of iterated jump graphs |
Chartrand, Gary |
2001 |
226 | 1-3 |
p. 93-106 14 p. |
artikel |
|
| 26 | Optimal binary linear codes of dimension at most seven |
Bouyukliev, Iliya |
2001 |
226 | 1-3 |
p. 51-70 20 p. |
artikel |
|
| 27 | Pebbling and Graham's Conjecture |
Wang, Stephen S. |
2001 |
226 | 1-3 |
p. 431-438 8 p. |
artikel |
|
| 28 | Perfect graphs of strong domination and independent strong domination |
Rautenbach, D. |
2001 |
226 | 1-3 |
p. 297-311 15 p. |
artikel |
|
| 29 | Proof of a conjecture by Walter Deuber concerning the distances between points of two types in R d |
Morgenstern, Dietrich |
2001 |
226 | 1-3 |
p. 347-349 3 p. |
artikel |
|
| 30 | Realization of set functions as cut functions of graphs and hypergraphs |
Fujishige, Satoru |
2001 |
226 | 1-3 |
p. 199-210 12 p. |
artikel |
|
| 31 | Resolvable BIBDs with block size 7 and index 6 |
Abel, R.Julian R. |
2001 |
226 | 1-3 |
p. 1-20 20 p. |
artikel |
|
| 32 | Shortest paths in conservative graphs |
Conforti, Michele |
2001 |
226 | 1-3 |
p. 143-153 11 p. |
artikel |
|
| 33 | The decay number and the maximum genus of diameter 2 graphs |
Fu, Hung-Lin |
2001 |
226 | 1-3 |
p. 191-197 7 p. |
artikel |
|
| 34 | The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots |
D'Antona, Ottavio M. |
2001 |
226 | 1-3 |
p. 387-396 10 p. |
artikel |
|
| 35 | The number of permutations with a given signature, and the expectations of their elements |
Szpiro, George G. |
2001 |
226 | 1-3 |
p. 423-430 8 p. |
artikel |
|
| 36 | Tolerance orders and bipartite unit tolerance graphs |
Bogart, Kenneth P. |
2001 |
226 | 1-3 |
p. 35-50 16 p. |
artikel |
|
| 37 | Two relations for median graphs |
Škrekovski, Riste |
2001 |
226 | 1-3 |
p. 351-353 3 p. |
artikel |
|
| 38 | Using minimum degree to bound average distance |
Beezer, R.A. |
2001 |
226 | 1-3 |
p. 365-371 7 p. |
artikel |
38 gevonden resultaten