|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
22 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A distributed algorithm to find k-dominating sets |
Penso, Lucia D |
2004 |
141 | 1-3 |
p. 243-253 11 p. |
artikel |
|
| 2 | An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid |
Morgana, Aurora |
2004 |
141 | 1-3 |
p. 225-241 17 p. |
artikel |
|
| 3 | AT-free graphs: linear bounds for the oriented diameter |
Fomin, Fedor V |
2004 |
141 | 1-3 |
p. 135-148 14 p. |
artikel |
|
| 4 | Author index to volume |
2004 |
141 | 1-3 |
p. 295-296 2 p. |
artikel |
||
| 5 | Bichromatic P 4-composition schemes for perfect orderability |
Hayward, R.B. |
2004 |
141 | 1-3 |
p. 161-183 23 p. |
artikel |
|
| 6 | Bounds for optimal coverings |
de A. Moreira, Carlos Gustavo T. |
2004 |
141 | 1-3 |
p. 263-276 14 p. |
artikel |
|
| 7 | Clique divergent clockwork graphs and partial orders |
Larrión, F |
2004 |
141 | 1-3 |
p. 195-207 13 p. |
artikel |
|
| 8 | Cliques and extended triangles. A necessary condition for planar clique graphs |
Alcón, Liliana |
2004 |
141 | 1-3 |
p. 3-17 15 p. |
artikel |
|
| 9 | Contents |
2004 |
141 | 1-3 |
p. viii-ix nvt p. |
artikel |
||
| 10 | Decomposition of odd-hole-free graphs by double star cutsets and 2-joins |
Conforti, Michele |
2004 |
141 | 1-3 |
p. 41-91 51 p. |
artikel |
|
| 11 | Distances and diameters on iterated clique graphs |
Pizaña, Miguel A. |
2004 |
141 | 1-3 |
p. 255-261 7 p. |
artikel |
|
| 12 | Editorial Board |
2004 |
141 | 1-3 |
p. v-vii nvt p. |
artikel |
||
| 13 | Exact enumeration of rooted 3-connected triangular maps on the projective plane |
Gao, Zhicheng |
2004 |
141 | 1-3 |
p. 149-159 11 p. |
artikel |
|
| 14 | Expected worst-case partial match in random quadtries |
Devroye, Luc |
2004 |
141 | 1-3 |
p. 103-117 15 p. |
artikel |
|
| 15 | Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum |
Dantas, Simone |
2004 |
141 | 1-3 |
p. 93-101 9 p. |
artikel |
|
| 16 | Guide for authors |
2004 |
141 | 1-3 |
p. I-IV nvt p. |
artikel |
||
| 17 | On the complexity of the approximation of nonplanarity parameters for cubic graphs |
Faria, Luerbio |
2004 |
141 | 1-3 |
p. 119-134 16 p. |
artikel |
|
| 18 | Partitioning chordal graphs into independent sets and cliques |
Hell, Pavol |
2004 |
141 | 1-3 |
p. 185-194 10 p. |
artikel |
|
| 19 | Phorma: perfectly hashable order restricted multidimensional arrays |
Lins, Lauro |
2004 |
141 | 1-3 |
p. 209-223 15 p. |
artikel |
|
| 20 | Preface |
Reed, Bruce A |
2004 |
141 | 1-3 |
p. 1- 1 p. |
artikel |
|
| 21 | Strong lower bounds for the prize collecting Steiner problem in graphs |
Lucena, Abilio |
2004 |
141 | 1-3 |
p. 277-294 18 p. |
artikel |
|
| 22 | Trees with three leaves are (n+1)-unavoidable |
Ceroi, S |
2004 |
141 | 1-3 |
p. 19-39 21 p. |
artikel |
22 gevonden resultaten