|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
24 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A sufficient condition for all short cycles |
Brandt, Stephan |
1997 |
79 | 1-3 |
p. 63-66 4 p. |
artikel |
|
| 2 | Author index |
1997 |
79 | 1-3 |
p. 285-286 2 p. |
artikel |
||
| 3 | Bypaths in tournaments |
Guo, Yubao |
1997 |
79 | 1-3 |
p. 127-135 9 p. |
artikel |
|
| 4 | Cardinality constrained Boolean quadratic polytope |
Mehrotra, Anuj |
1997 |
79 | 1-3 |
p. 137-154 18 p. |
artikel |
|
| 5 | Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three |
Andreae, Thomas |
1997 |
79 | 1-3 |
p. 3-34 32 p. |
artikel |
|
| 6 | Characterizations and algorithmic applications of chordal graph embeddings |
Parra, Andreas |
1997 |
79 | 1-3 |
p. 171-188 18 p. |
artikel |
|
| 7 | Coloring edges of self-complementary graphs |
Wojda, A.Paweł |
1997 |
79 | 1-3 |
p. 279-284 6 p. |
artikel |
|
| 8 | Editorial Board |
1997 |
79 | 1-3 |
p. iii-iv nvt p. |
artikel |
||
| 9 | List colorings and reducibility |
Tuza, Zs. |
1997 |
79 | 1-3 |
p. 247-256 10 p. |
artikel |
|
| 10 | Maximal independent sets in graphs with at most one cycle |
Jou, Min-Jen |
1997 |
79 | 1-3 |
p. 67-73 7 p. |
artikel |
|
| 11 | On the average Steiner distance of graphs with prescribed properties |
Dankelmann, Peter |
1997 |
79 | 1-3 |
p. 91-103 13 p. |
artikel |
|
| 12 | Optimal channel allocation for several types of cellular radio networks |
Niessen, Thomas |
1997 |
79 | 1-3 |
p. 155-170 16 p. |
artikel |
|
| 13 | Polyhedral graphs without hamiltonian cycles |
Walther, Hansjoachim |
1997 |
79 | 1-3 |
p. 257-263 7 p. |
artikel |
|
| 14 | Preface |
Faigle, Ulrich |
1997 |
79 | 1-3 |
p. 1- 1 p. |
artikel |
|
| 15 | Ramsey numbers r(K 3, G) for connected graphs G of order seven |
Schelten, Annette |
1997 |
79 | 1-3 |
p. 189-200 12 p. |
artikel |
|
| 16 | Small cycles in Hamiltonian graphs |
Schelten, Uwe |
1997 |
79 | 1-3 |
p. 201-211 11 p. |
artikel |
|
| 17 | Spanning local tournaments in locally semicomplete digraphs |
Guo, Yubao |
1997 |
79 | 1-3 |
p. 119-125 7 p. |
artikel |
|
| 18 | The complexity of recognizing tough cubic graphs |
Bauer, D. |
1997 |
79 | 1-3 |
p. 35-44 10 p. |
artikel |
|
| 19 | The setup polyhedron of series-parallel posets |
Schrader, Rainer |
1997 |
79 | 1-3 |
p. 213-221 9 p. |
artikel |
|
| 20 | Tight approximations for resource constrained scheduling and bin packing |
Srivastav, Anand |
1997 |
79 | 1-3 |
p. 223-245 23 p. |
artikel |
|
| 21 | Transversal partitioning in balanced hypergraphs |
Dahlhaus, Elias |
1997 |
79 | 1-3 |
p. 75-89 15 p. |
artikel |
|
| 22 | Tree enterprises and bankruptcy ventures A game theoretic similarity due to a graph theoretic proof |
Driessen, Theo S.H. |
1997 |
79 | 1-3 |
p. 105-117 13 p. |
artikel |
|
| 23 | Treewidth for graphs with small chordality |
Bodlaender, Hans L. |
1997 |
79 | 1-3 |
p. 45-61 17 p. |
artikel |
|
| 24 | Vertex-distinguishing edge-colorings of 2-regular graphs |
Wittmann, P. |
1997 |
79 | 1-3 |
p. 265-277 13 p. |
artikel |
24 gevonden resultaten