Journals in DBLP
Combinatorica 1991, volume: 11, number: 2
Robert E. L. Aldred , Derek A. Holton , Bill Jackson Uniform cyclic edge connectivity in cubic graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:2, pp:81-96 [Journal ] Noga Alon , Yossi Azar Parallel comparison algorithms for approximation problems. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:2, pp:97-122 [Journal ] Roland Häggkvist , Andrew Thomason Trees in tournaments. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:2, pp:123-130 [Journal ] Péter Hajnal An Omega(n^{4/3} ) lower bound on the randomized complexity of graph properties. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:2, pp:131-143 [Journal ] Nora Hartsfield , Gerhard Ringel Clean triangulations. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:2, pp:145-155 [Journal ] Bala Kalyanasundaram , Georg Schnitger On the power of white pebbles. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:2, pp:157-171 [Journal ] Xiaoyun Lu On claws belonging to every tournament. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:2, pp:173-179 [Journal ] András Gyárfás , Jenö Lehel Effective on-line coloring of P_{5} -free graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:2, pp:181-184 [Journal ]