Journal of Combinatorial Theory, Series B, Volume 42

Volume 42, Number 1, February 1987

• John Donald, John Elwin, Richard Hager, Peter Salamon:
  Handle bases and bounds on the number of subgraphs. 1-13
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  The enumeration of akempic triangulations. 14-23
  Electronic Edition (link) BibTeX
• Geoff Whittle:
  Modularity of tangential k-blocks. 24-35
  Electronic Edition (link) BibTeX
• Paul D. Seymour, Carsten Thomassen:
  Characterization of even directed graphs. 36-45
  Electronic Edition (link) BibTeX
• W. L. Kocay:
  A family of nonreconstructible hypergraphs. 46-63
  Electronic Edition (link) BibTeX
• Paul Terwilliger:
  P and Q polynomial schemes with q = -1. 64-67
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  Simplicial schemes. 68-86
  Electronic Edition (link) BibTeX
• Kiyoshi Ando, Hikoe Enomoto, Akira Saito:
  Contractible edges in 3-connected graphs. 87-93
  Electronic Edition (link) BibTeX
• Herbert Fleischner, Bill Jackson:
  Compatible path-cycle-decompositions of plane graphs. 94-121
  Electronic Edition (link) BibTeX
• Rudolf Mathon:
  Lower bounds for Ramsey numbers and association schemes. 122-127
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Counterexamples to Adám's conjecture on arc reversals in directed graphs. 128-130
  Electronic Edition (link) BibTeX

Volume 42, Number 2, April 1987

• Reinhard Diestel:
  Simplicial decompositions of graphs - Some uniqueness results. 133-145
  Electronic Edition (link) BibTeX
• Jon Henry Sanders:
  Circuit preserving edge maps II. 146-155
  Electronic Edition (link) BibTeX
• Jean-Pierre Roudneff:
  An inequality for 3-polytopes. 156-166
  Electronic Edition (link) BibTeX
• Abdelhamid Benhocine, A. Pawel Wojda:
  The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs. 167-180
  Electronic Edition (link) BibTeX
• Alan M. Frieze, B. Jackson:
  Large induced trees in sparse random graphs. 181-195
  Electronic Edition (link) BibTeX
• Ying Cheng, James G. Oxley:
  On weakly symmetric graphs of order twice a prime. 196-211
  Electronic Edition (link) BibTeX
• James G. Oxley:
  A characterization of the ternary matroids with no M(K₄)-minor. 212-249
  Electronic Edition (link) BibTeX
• David W. Barnette:
  5-connected 3-polytopes are refinements of octahedra. 250-254
  Electronic Edition (link) BibTeX

Volume 42, Number 3, June 1987

• Bor-Liang Chen, Ko-Wei Lih:
  Hamiltonian uniform subset graphs. 257-263
  Electronic Edition (link) BibTeX
• Chính T. Hoàng:
  Alternating orientation and alternating colouration of perfect graphs. 264-273
  Electronic Edition (link) BibTeX
• Kenneth A. Berman:
  Balanced vertex weightings and arborescences. 274-301
  Electronic Edition (link) BibTeX
• Chính T. Hoàng:
  On a conjecture of Meyniel. 302-312
  Electronic Edition (link) BibTeX
• Alan Tucker:
  Coloring perfect (K₄ - e)-free graphs. 313-318
  Electronic Edition (link) BibTeX
• Tamás Terlaky:
  A finite crisscross method for oriented matroids. 319-327
  Electronic Edition (link) BibTeX
• Lin Yucai, Huang Guoxun, Li Jiongsheng:
  Score vectors of Kotzig tournaments. 328-336
  Electronic Edition (link) BibTeX
• Thomas Zaslavsky:
  The biased graphs whose matroids are binary. 337-347
  Electronic Edition (link) BibTeX
• Andrew M. Odlyzko, Herbert S. Wilf:
  Bandwidths and profiles of trees. 348-370
  Electronic Edition (link) BibTeX
• Yoshimi Egawa:
  Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph. 371-377
  Electronic Edition (link) BibTeX
• T. A. McKee:
  Generalized complementation. 378-383
  Electronic Edition (link) BibTeX