The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1988, volume: 69, number: 1

  1. Ian Anderson
    An Erdös-Ko-Rado theorem for multisets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:1-9 [Journal]
  2. Achim Bachem, Walter Kern
    On sticky matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:11-18 [Journal]
  3. Mark N. Ellingham
    Isomorphic factorization of r-regular graphs into r parts. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:19-34 [Journal]
  4. András Gyárfás, Michael S. Jacobson, Lael F. Kinch
    On a generalization of transitivity for digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:35-41 [Journal]
  5. Hong-Jian Lai
    On the Hamiltonian index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:43-53 [Journal]
  6. Guizhen Liu
    A lower bound on connectivities of matroid base graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:55-60 [Journal]
  7. Francesco M. Malvestuto
    Existence of extensions and product extensions for discrete probability distributions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:61-77 [Journal]
  8. Gary L. Mullen
    Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:79-84 [Journal]
  9. Bing Zhou
    The maximum number of cycles in the complement of a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:85-94 [Journal]
  10. Zsolt Tuza
    Isomorphism of two infinite-chromatic triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:95- [Journal]
  11. Robert Grone, Russell Merris
    A bound for the complexity of a simple graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:97-99 [Journal]
  12. Friedrich Otto
    An example of a one-relator group that is not a one-relation monoid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:101-103 [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