Journals in DBLP

J. Comb. Theory, Ser. B
2001, volume: 83, number: 2

1. Florian Roussel, P. Rubio
   About Skew Partitions in Minimal Imperfect Graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:171-190 [Journal]
   
2. Eli Berger
   Dynamic Monopolies of Constant Size. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:191-200 [Journal]
   
3. Daniel P. Sanders, Yue Zhao
   Planar Graphs of Maximum Degree Seven are Class I. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:201-212 [Journal]
   
4. Guantao Chen, Ronald J. Gould, Hao Li
   Partitioning Vertices of a Tournament into Independent Cycles. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:213-220 [Journal]
   
5. Tao Jiang
   On a Conjecture about Trees in Graphs with Large Girth. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:221-232 [Journal]
   
6. Abraham Berman, Xiao-Dong Zhang
   On the Spectral Radius of Graphs with Cut Vertices. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:233-240 [Journal]
   
7. Michael Krivelevich, Van H. Vu
   Choosability in Random Hypergraphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:241-257 [Journal]
   
8. Martin Kochol
   An Equivalent Version of the 3-Flow Conjecture. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:258-261 [Journal]
   
9. Carsten Thomassen
   Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:262-271 [Journal]
   
10. Jason I. Brown, Carl A. Hickman, Alan D. Sokal, David G. Wagner
    On the Chromatic Roots of Generalized Theta Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:272-297 [Journal]
    
11. Criel Merino, Anna de Mier, Marc Noy
    Irreducibility of the Tutte Polynomial of a Connected Matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:298-304 [Journal]
    
12. Matthias Kriesell
    Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:305-319 [Journal]
    
13. Michael U. Gerber, Alain Hertz
    A Transformation Which Preserves the Clique Number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:320-330 [Journal]
    
14. Stéphan Thomassé
    Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:331-333 [Journal]