Volume 7, Issue 3 | Combinatorica

Search all Combinatorica articles

Volume 7, Issue 3

September 1987

Filter by

Volume:

Sort by

Date published:

New to old Old to new

10 articles in this issue

On a problem of Erdős concerning property B
H. L. Abbott
A. Liu
OriginalPaper Pages: 215 - 219
Bounds on the convex label number of trees
Marshall Bern
Alice Wong
Maria Klawe
OriginalPaper Pages: 221 - 230
Finding a small 3-connected minor maintaining a fixed minor and a fixed element
Robert E. Bixby
C. R. Coullard
OriginalPaper Pages: 231 - 242
Reducing prime graphs and recognizing circle graphs
André Bouchet
OriginalPaper Pages: 243 - 254
Directed cut transversal packing for source-sink connected graphs
P. Feofiloff
D. H. Younger
OriginalPaper Pages: 255 - 263
Large holes in sparse random graphs
A. M. Frieze
B. Jackson
OriginalPaper Pages: 265 - 274
Expose-and-merge exploration and the chromatic number of a random graph
D. W. Matula
OriginalPaper Pages: 275 - 284
A problem of Erdős on abelian groups
J. E. Olson
OriginalPaper Pages: 285 - 289
Quasi-symmetric 2, 3, 4-designs
Sharad S. Sane
Mohan S. Shrikhande
OriginalPaper Pages: 291 - 301
Subgraphs of colour-critical graphs
M. Stiebitz
OriginalPaper Pages: 303 - 312