Journals in DBLP

J. Comb. Theory, Ser. B
2000, volume: 80, number: 2

1. John Maharry
   A Characterization of Graphs with No Cube Minor. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:179-201 [Journal]
   
2. Alexander A. Ageev, Alexandr V. Kostochka
   Vertex Set Partitions Preserving Conservativeness. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:202-217 [Journal]
   
3. Carsten Thomassen
   Chromatic Roots and Hamiltonian Paths. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:218-224 [Journal]
   
4. János Pach, Géza Tóth
   Which Crossing Number Is It Anyway? [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:225-246 [Journal]
   
5. Hirobumi Mizuno, Iwao Sato
   Zeta Functions of Graph Coverings. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:247-257 [Journal]
   
6. Gregory L. Cherlin, Brenda J. Latka
   Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:258-276 [Journal]
   
7. J. D. Skinner II, C. A. B. Smith, W. T. Tutte
   On the Dissection of Rectangles into Right-Angled Isosceles Triangles. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:277-319 [Journal]
   
8. Béla Bollobás, Luke Pebody, Oliver Riordan
   Contraction-Deletion Invariants for Graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:320-345 [Journal]
   
9. Alexander Schrijver
   A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:346-355 [Journal]
   
10. Yuanqiu Huang, Yanpei Liu
    Face Size and the Maximum Genus of a Graph 1. Simple Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:356-370 [Journal]