Journals in DBLP

J. Comb. Theory, Ser. B
1979, volume: 27, number: 2

1. Edgar M. Palmer, Allen J. Schwenk
   On the number of trees in a random forest. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:109-121 [Journal]
   
2. M. J. Rigby, Roger B. Mallion
   On the eigenvalues and eigenvectors of certain finite, vertex-weighted, bipartite graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:122-129 [Journal]
   
3. Kenneth Appel, Wolfgang Haken, Jean Mayer
   Triangulation a v5 séparés dans le problème des quatre couleurs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:130-150 [Journal]
   
4. Jack E. Graver
   The imbedding index of a graph. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:151-159 [Journal]
   
5. C. C. Chen, H. H. Teh
   Constructions of point-colour-symmetric graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:160-167 [Journal]
   
6. Robert E. Woodrow
   There are four countable ultrahomogeneous graphs without triangles. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:168-179 [Journal]
   
7. László Babai
   Spectra of Cayley graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:180-189 [Journal]
   
8. Eva Nosal
   Partition relations for denumerable ordinals. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:190-197 [Journal]
   
9. Edward F. Schmeichel, Gary S. Bloom
   Connectivity, genus, and the number of components in vertex-deleted subgraphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:198-201 [Journal]
   
10. Thomas Andreae
    Über eine eigenschaft lokalfiniter, unendlicher bäume. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:202-215 [Journal]
    
11. Hien Q. Nguyen
    Constructing the free erection of a geometry. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:216-224 [Journal]
    
12. Jaroslav Nesetril, Vojtech Rödl
    A short proof of the existence of highly chromatic hypergraphs without short cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:225-227 [Journal]
    
13. F. Stersoul
    A characterization of the graphs in which the transversal number equals the matching number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:228-229 [Journal]