Journals in DBLP

J. Comb. Theory, Ser. B
1981, volume: 31, number: 3

1. Z. Baranyai, Gy. R. Szász
   Hamiltonian decomposition of lexicographic product. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:253-261 [Journal]
   
2. Jean-Luc Fouquet, J. L. Jolivet, M. Rivière
   Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:262-281 [Journal]
   
3. Mark K. Goldberg
   Construction of class 2 graphs with maximum vertex degree 3. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:282-291 [Journal]
   
4. Anton Kotzig
   Decompositions of complete graphs into isomorphic cubes. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:292-296 [Journal]
   
5. Denis Naddef, William R. Pulleyblank
   Hamiltonicity and combinatorial polyhedra. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:297-312 [Journal]
   
6. Rick Giles, Leslie E. Trotter Jr.
   On stable set polyhedra for K_{1, 3}-free graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:313-326 [Journal]
   
7. Paul D. Seymour
   Even circuits in planar graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:327-338 [Journal]
   
8. Ahmed Ainouche, Nicos Christofides
   Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:339-343 [Journal]
   
9. D. L. Greenwell, D. G. Hoffman
   On a probabilistic method in graph theory. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:344-347 [Journal]
   
10. Fan R. K. Chung, Ronald L. Graham, James B. Shearer
    Universal caterpillars. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:348-355 [Journal]