The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1984, volume: 36, number: 3

  1. András Frank
    Finding feasible vectors of Edmonds-Giles polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:221-239 [Journal]
  2. Peter M. Gibson
    A bound for the number of tournaments with specified scores. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:240-243 [Journal]
  3. Thomas W. Tucker
    A refined Hurwitz theorem for imbeddings of irredundant Cayley graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:244-268 [Journal]
  4. Thomas W. Tucker
    There is one group of genus two. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:269-275 [Journal]
  5. Edward A. Bender, L. Bruce Richmond
    The asymptotic enumeration of rooted convex polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:276-283 [Journal]
  6. Ján Plesník
    A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:284-297 [Journal]
  7. Michael O. Albertson, Karen L. Collins
    Duality and perfection for edges in cliques. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:298-309 [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