Journals in DBLP

J. Comb. Theory, Ser. B
2006, volume: 96, number: 4

1. Juan José Montellano-Ballesteros, Ricardo Strausz
   A characterization of cocircuit graphs of uniform oriented matroids. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:445-454 [Journal]
   
2. Petr Hlinený
   Crossing number is hard for cubic graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:455-471 [Journal]
   
3. Michael O. Albertson, Douglas B. West
   Extending precolorings to circular colorings. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:472-481 [Journal]
   
4. Xingxing Yu, Florian Zickfeld
   Reducing Hajós' 4-coloring conjecture to 4-connected graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:482-492 [Journal]
   
5. Hong-Jian Lai, Yehong Shao, Mingquan Zhan
   Hamiltonicity in 3-connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:493-504 [Journal]
   
6. Serguei Norine, Robin Thomas
   Minimal bricks. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:505-513 [Journal]
   
7. Sang-il Oum, Paul D. Seymour
   Approximating clique-width and branch-width. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:514-528 [Journal]
   
8. Mark N. Ellingham, Chris Stephens, Xiaoya Zha
   The nonorientable genus of complete tripartite graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:529-559 [Journal]
   
9. James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle
   Obstructions to branch-decomposition of matroids. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:560-570 [Journal]
   
10. Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
    Every 3-connected, essentially 11-connected line graph is Hamiltonian. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:571-576 [Journal]
    
11. Saieed Akbari, Vahab S. Mirrokni, Bashir S. Sadjad
    A relation between choosability and uniquely list colorability. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:577-583 [Journal]
    
12. Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Short paths in quasi-random triple systems with sparse underlying graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:584-607 [Journal]
    
13. Yonatan Bilu
    Tales of Hoffman: Three extensions of Hoffman's bound on the graph chromatic number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:608-613 [Journal]
    
14. Peter Keevash, Benny Sudakov
    Sparse halves in triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:614-620 [Journal]