The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1980, volume: 28, number: 2

  1. W. T. Tutte
    On the enumeration of convex polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:105-126 [Journal]
  2. Ioan Tomescu
    Some properties of irreducible coverings by cliques of complete multipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:127-141 [Journal]
  3. Carsten Thomassen
    Hamiltonian-connected tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:142-163 [Journal]
  4. Rudolf Ahlswede
    Simple hypergraphs with maximal number of adjacent pairs of edges. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:164-167 [Journal]
  5. Peter J. Cameron
    6-Transitive graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:168-179 [Journal]
  6. Y. Alavi, M. Behzad, E. A. Nordhaus
    Minimal separating sets of maximum size. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:180-183 [Journal]
  7. Victor Klee
    Classification and enumeration of minimum (d, 3, 3)-graphs for odd d. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:184-207 [Journal]
  8. László Lovász
    Matroid matching and some applications. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:208-236 [Journal]
  9. Paul D. Seymour
    Packing and covering with matroid circuits. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:237-242 [Journal]
  10. William G. Frye, Renu Laskar
    Path number of bipartite digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:243-244 [Journal]
  11. Rainer E. Burkard, Peter L. Hammer
    A note on Hamiltonian split graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:245-248 [Journal]
  12. James G. Oxley
    On Hartfiel and Maxson's definition of connected sets of a matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:249-250 [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