The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1985, volume: 54, number: 2

  1. Michael O. Albertson, Karen L. Collins
    Homomorphisms of 3-chromatic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:127-132 [Journal]
  2. Malvina Baica
    Some new combinatorial identities derived from units in algebraic number fields. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:133-141 [Journal]
  3. Ourania Chryssaphinou
    On Touchard polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:143-152 [Journal]
  4. Konrad Engel, Hans-Dietrich O. F. Gronau
    An intersection-union theorem for integer sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:153-159 [Journal]
  5. Bruce Hedman
    The maximum number of cliques in dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:161-166 [Journal]
  6. Irwin L. Jungreis
    Infinite Hamiltonian paths in Cayley digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:167-180 [Journal]
  7. John H. Reif, Paul G. Spirakis
    k-connectivity in random undirected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:181-191 [Journal]
  8. Jan Reiterman, Vojtech Rödl, Edita Sinajová, Miroslav Tuma
    Threshold hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:193-200 [Journal]
  9. Doron Zeilberger, David M. Bressoud
    A proof of Andrews' q-Dyson conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:201-224 [Journal]
  10. H. J. Tiersma
    A note on Hamming spheres. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:225-228 [Journal]
  11. Peter Alles
    The dimension of sums of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:229-233 [Journal]
  12. Edward A. Bender, Nicholas C. Wormald
    The number of loopless planar maps. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:235-237 [Journal]
  13. Geoffrey P. Whittle
    An elementary proof that every matroid is an intersection of principal transversal matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:239- [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