The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorica
1984, volume: 4, number: 2

  1. Jeremy E. Dawson, Jennifer Seberry, David B. Skillicorn
    The directed packing numbers DD (t, v, v), t>=;4. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:121-130 [Journal]
  2. György Elekes
    n points in the plane can determine n 3/2 unit circles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:131-131 [Journal]
  3. Konrad Engel
    An Erdös - Ko- Rado theorem for the subcubes of a cube. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:133-140 [Journal]
  4. Peter Frankl, Vojtech Rödl
    Families of finite sets with three intersections. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:141-148 [Journal]
  5. Peter Frankl
    Hypergraphs do not jump. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:149-159 [Journal]
  6. Zoltán Füredi
    Hypergraphs in which all disjoint pairs have distinct unions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:161-168 [Journal]
  7. Frank Harary, Robert W. Robinson
    Isomorphic factorizations VIII: Bisectable trees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:169-179 [Journal]
  8. Jeff Kahn, Michael E. Saks
    A polyomino with no stochastic function. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:181-182 [Journal]
  9. Henry A. Kierstead, Endre Szemerédi, William T. Trotter
    On coloring graphs with locally small chromatic number. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:183-185 [Journal]
  10. James G. Oxley
    On the intersections of circuits and cocircuits in matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:187-195 [Journal]
  11. K. R. Parthasarathy, N. Srinivasan
    Geodetic blocks of diameter three. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:197-206 [Journal]
  12. S. C. Shee, H. H. Teh
    H-extensions of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:207-212 [Journal]
  13. László A. Székely
    Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:213-218 [Journal]
  14. Bernd Voigt
    Canonization theorems for finite affine and linear spaces. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:219-239 [Journal]
  15. Alfred Weiss
    Girth of bipartite sextet graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:241-245 [Journal]
  16. Richard M. Wilson
    The exact bound in the Erdös - Ko - Rado theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:247-257 [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