Journals in DBLP

J. Comb. Theory, Ser. B
1978, volume: 25, number: 3

1. Mordechai Lewin
   On path connected graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:245-257 [Journal]
   
2. Julie Sims, Derek A. Holton
   Stability of cartesian products. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:258-282 [Journal]
   
3. Michel Las Vergnas
   Bases in oriented matroids. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:283-289 [Journal]
   
4. Anthony J. W. Hilton, Rhys Price Jones
   Partitioning the edges of a graph. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:290-294 [Journal]
   
5. Norbert Sauer, Joel Spencer
   Edge disjoint placement of graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:295-302 [Journal]
   
6. Herbert Pahlings
   On the chromatic number of skew graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:303-306 [Journal]
   
7. Marie-Claude Heydemann
   Spectral characterization of some graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:307-312 [Journal]
   
8. Colin McDiarmid
   Blocking, antiblocking, and pairs of matroids and polymatroids. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:313-325 [Journal]
   
9. Peter J. Slater
   A constructive characterization of trees with at least k disjoint maximum matchings. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:326-338 [Journal]
   
10. Frank Allaire, Edward Reinier Swart
    A systematic approach to the determination of reducible configurations in the four-color conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:339-362 [Journal]
    
11. Béla Bollobás
    The number of 1-factors in 2k-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:363-366 [Journal]