|
Journals in DBLP
- Pierre Duchet
Parity graphs are kernel-M-solvable. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:121-126 [Journal]
- András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
Local k-colorings of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:127-139 [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:140-150 [Journal]
- Alan Tucker
A reduction procedure for coloring perfect K4-free graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:151-172 [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:173-186 [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:187-222 [Journal]
- B. Reed
A semi-strong Perfect Graph theorem. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:223-240 [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:241-243 [Journal]
|