61 search results - page 5 / 13 » dm 2000 |
DM
2000
14 years 11 months ago
2000
In this paper, we
52
Voted
DM
2000
14 years 11 months ago
2000
DM
2000
14 years 11 months ago
2000
We will prove a d-dimensional version of the Geelen and Simpson theorem. c 2000 Elsevier Science B.V. All rights reserved.
DM
2000
14 years 11 months ago
2000
The graph G(N; d) has vertex set V = {0; 1; : : : ; N - 1}, with {v; w} an edge if v - w
DM
2000
14 years 11 months ago
2000
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi