The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1987, volume: 43, number: 2

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002