Journals in DBLP

J. Comb. Theory, Ser. B
1990, volume: 50, number: 2

1. David B. Surowski
   Lifting map automorphisms and MacBeath's theorem. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:135-149 [Journal]
   
2. Éva Tardos
   An intersection theorem for supermatroids. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:150-159 [Journal]
   
3. Kazumasa Nomura
   Distance-regular graphs of hamming type. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:160-167 [Journal]
   
4. Ron Aharoni, Mao Lin Zheng
   Counting 1-factors in infinite graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:168-178 [Journal]
   
5. Elke Wilkeit
   Isometric embeddings in Hamming graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:179-197 [Journal]
   
6. Carsten Thomassen
   Bidirectional retracting-free double tracings and upper embeddability of graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:198-207 [Journal]
   
7. Marion Alfter, Walter Kern, Alfred Wanka
   On adjoints and dual matroids. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:208-213 [Journal]
   
8. Kazumasa Nomura
   Intersection diagrams of distance-biregular graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:214-221 [Journal]
   
9. Marc E. Bertschi
   Perfectly contractile graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:222-230 [Journal]
   
10. Alain Hertz
    A fast algorithm for coloring Meyniel graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:231-240 [Journal]
    
11. Yahya Ould Hamidoune
    On the numbers of independent k-sets in a claw free graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:241-244 [Journal]
    
12. Herbert Fleischner, András Frank
    On circuit decomposition of planar Eulerian graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:245-253 [Journal]
    
13. Denise Amar, Yannis Manoussakis
    Cycles and paths of many lengths in bipartite digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:254-264 [Journal]
    
14. Jon Lee
    The incidence structure of subspaces with well-scaled frames. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:265-287 [Journal]
    
15. Li Jiongsheng, Huang Daode, Pan Qun
    Digraphs with degree equivalent induced subdigraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:288-298 [Journal]
    
16. W. Bienia, I. P. da Silva
    On the inversion of the sign of one basis in an oriented matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:299-308 [Journal]
    
17. Béla Bollobás, Roland Häggkvist
    Powers of Hamilton cycles in tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:309-318 [Journal]
    
18. Shaoji Xu
    The size of uniquely colorable graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:319-320 [Journal]
    
19. Peter Horák
    A coloring problem related to the Erdös-Faber-Lovász conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:321-322 [Journal]