The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1999, volume: 200, number: 1-3

  1. Béla Bollobás, Paul Erdös, Amites Sarkar
    Extremal graphs for weights. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:5-19 [Journal]
  2. John Adrian Bondy, Paul Erdös, Siemion Fajtlowicz
    Graphs of diameter two with no 4-circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:21-25 [Journal]
  3. Marc Deléglise, Paul Erdös, Jean-Louis Nicolas
    Sur les ensembles représentés par les partitions d'un entier n1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:27-48 [Journal]
  4. Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi
    On a question about sum-free sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:49-54 [Journal]
  5. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    The number of cycle lengths in graphs of given minimum degree and girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:55-60 [Journal]
  6. Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós
    Induced subgraphs of given sizes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:61-77 [Journal]
  7. Paul Erdös, András Gyárfás
    Split and balanced colorings of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:79-86 [Journal]
  8. Paul Erdös, Richard Roxby Hall
    On the angular distribution of Gaussian integers with fixed norm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:87-94 [Journal]
  9. Paul Erdös, Gergely Harcos, János Pach
    Popular distances in 3-space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:95-99 [Journal]
  10. Paul Erdös, Grigori Kolesnik
    Prime power divisors of binomial coefficients. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:101-117 [Journal]
  11. Paul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy
    Greedy algorithm, arithmetic progressions, subset sums and divisibility. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:119-135 [Journal]
  12. Paul Erdös, Janice L. Malouf, J. L. Selfridge, Esther Szekeres
    Subsets of an interval whose product is a power. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:137-147 [Journal]
  13. Paul Erdös, Christian Mauduit, András Sárközy
    On arithmetic properties of integers with missing digits II: Prime factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:149-164 [Journal]
  14. Paul Erdös, Péter P. Pálfy
    On the orders of directly indecomposable groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:165-179 [Journal]
  15. Paul Erdös, Gerald Tenenbaum
    Ensembles de multiples de suites finies. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:181-203 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002