
Journals in DBLP
 Pierre Duchet
Parity graphs are kernelMsolvable. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:121126 [Journal]
 András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
Local kcolorings of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:127139 [Journal]
 James W. Walker
Strict refinement for graphs and digraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:140150 [Journal]
 Alan Tucker
A reduction procedure for coloring perfect K_{4}free graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:151172 [Journal]
 Douglas A. Miller
Oriented matroids from smooth manifolds. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:173186 [Journal]
 László Lovász
Matching structure and the matching lattice. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:187222 [Journal]
 B. Reed
A semistrong Perfect Graph theorem. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:223240 [Journal]
 Gadi Moran
A remark on embedded bipartite graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:241243 [Journal]
