Journals in DBLP

J. Comb. Theory, Ser. B
1986, volume: 40, number: 2

1. Edwin C. Ihrig
   Symmetry groups related to the construction of perfect one factorizations of K_2n. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:121-151 [Journal]
   
2. Wolfgang Mader
   Kritisch n-fach kantenzusammenhängende Graphen. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:152-158 [Journal]
   
3. Robin W. Dawes
   Minimally 3-connected graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:159-168 [Journal]
   
4. Ying Cheng, Albert L. Wells Jr.
   Switching classes of directed graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:169-186 [Journal]
   
5. Geoffrey R. Grimmett
   An exact threshold theorem for random graphs and the node-packing problem. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:187-195 [Journal]
   
6. Alan M. Frieze
   Maximum matchings in a class of random graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:196-212 [Journal]
   
7. Paul Terwilliger
   A class of distance-regular graphs that are Q-polynomial. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:213-223 [Journal]
   
8. Jan Kratochvíl
   Perfect codes over graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:224-228 [Journal]
   
9. Herbert Fleischner
   Proof of the strong 2-Cover Conjecture for planar graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:229-230 [Journal]
   
10. Hiroshi Maehara
    Sphericity exceeds cubicity for almost all complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:231-235 [Journal]