|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
22 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A degree condition of 2-factors in bipartite graphs |
Li, Xiangwen |
2001 |
113 | 2-3 |
p. 311-318 8 p. |
article |
|
| 2 | A note about games-composition dimension |
Freixas, J. |
2001 |
113 | 2-3 |
p. 265-273 9 p. |
article |
|
| 3 | A strongly polynomial time algorithm for a constrained submodular optimization problem |
Hartvigsen, David |
2001 |
113 | 2-3 |
p. 183-194 12 p. |
article |
|
| 4 | Author Index to Volume 113 (2001) |
2001 |
113 | 2-3 |
p. 343-344 2 p. |
article |
||
| 5 | Bounds for isoperimetric constants of infinite plane graphs |
Lawrencenko, Serge |
2001 |
113 | 2-3 |
p. 237-241 5 p. |
article |
|
| 6 | Cycle regular graphs need not be transitive |
Fouquet, Jean-Luc |
2001 |
113 | 2-3 |
p. 261-264 4 p. |
article |
|
| 7 | Cycles of length 1 modulo 3 in graph |
Mei, LU |
2001 |
113 | 2-3 |
p. 329-336 8 p. |
article |
|
| 8 | Deterministic inverse zero-patterns |
Johnson, Charles R. |
2001 |
113 | 2-3 |
p. 211-236 26 p. |
article |
|
| 9 | Diameter determination on restricted graph families |
Corneil, Derek G. |
2001 |
113 | 2-3 |
p. 143-166 24 p. |
article |
|
| 10 | Easy cases of the D0L sequence equivalence problem |
Honkala, Juha |
2001 |
113 | 2-3 |
p. 285-290 6 p. |
article |
|
| 11 | Efficient line broadcasting in a d-dimensional grid |
Averbuch, A. |
2001 |
113 | 2-3 |
p. 129-141 13 p. |
article |
|
| 12 | Finding the k most vital edges with respect to minimum spanning trees for fixed k |
Liang, Weifa |
2001 |
113 | 2-3 |
p. 319-327 9 p. |
article |
|
| 13 | On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane |
Hosono, Kiyoshi |
2001 |
113 | 2-3 |
p. 291-298 8 p. |
article |
|
| 14 | On completing latin squares |
Easton, T. |
2001 |
113 | 2-3 |
p. 167-181 15 p. |
article |
|
| 15 | On the equitable chromatic number of complete n-partite graphs |
Lam, Peter Che Bor |
2001 |
113 | 2-3 |
p. 307-310 4 p. |
article |
|
| 16 | On the visibility graph of convex translates |
Hosono, Kiyoshi |
2001 |
113 | 2-3 |
p. 195-210 16 p. |
article |
|
| 17 | Optimal arrangement of data in a tree directory |
Luczak, M.J. |
2001 |
113 | 2-3 |
p. 243-253 11 p. |
article |
|
| 18 | Optimal quantitative group testing on cycles and paths |
Hwang, F.K. |
2001 |
113 | 2-3 |
p. 299-302 4 p. |
article |
|
| 19 | Recognition of quasi-Meyniel graphs |
de Figueiredo, Celina M.H. |
2001 |
113 | 2-3 |
p. 255-260 6 p. |
article |
|
| 20 | Relative completeness with respect to two unary functions |
Pantović, Jovanka |
2001 |
113 | 2-3 |
p. 337-342 6 p. |
article |
|
| 21 | Smallest independent dominating sets in Kronecker products of cycles |
Jha, Pranava K. |
2001 |
113 | 2-3 |
p. 303-306 4 p. |
article |
|
| 22 | The edge versus path incidence matrix of series-parallel graphs and greedy packing |
Hoffman, Alan J. |
2001 |
113 | 2-3 |
p. 275-284 10 p. |
article |
22 results found