Journal of Combinatorial Theory, Series B, Volume 61

Volume 61, Number 1, May 1994

• Akira Hiraki:
  An Improvement of the Boshier-Nomura Bound. 1-4
  Electronic Edition (link) BibTeX
• Nathan Linial, Yuri Rabinovich:
  Local and Global Clique Numbers. 5-15
  Electronic Edition (link) BibTeX
• Edward R. Scheinerman, Jennifer S. Zito:
  On the Size of Hereditary Classes of Graphs. 16-39
  Electronic Edition (link) BibTeX
• Vladimir P. Korzhik:
  A Lower Bound for the One-Chromatic Number of a Surface. 40-56
  Electronic Edition (link) BibTeX
• Maurits de Graaf, Alexander Schrijver:
  Grid Minors of Graphs on the Torus. 57-62
  Electronic Edition (link) BibTeX
• Stephan Brandt:
  Subtrees and Subforests of Graphs. 63-70
  Electronic Edition (link) BibTeX
• John Frederick Fink:
  On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees. 71-82
  Electronic Edition (link) BibTeX
• Bor-Liang Chen, Ko-Wei Lih:
  Equitable Coloring of Trees. 83-87
  Electronic Edition (link) BibTeX
• Paul D. Seymour:
  A Note on Hyperplane Generation. 88-91
  Electronic Edition (link) BibTeX
• Dominique Bénard, Jean-Luc Fouquet:
  Expansion of Centered Triangulations. 92-102
  Electronic Edition (link) BibTeX
• Hitoshi Suzuki:
  On Distance-Regular Graphs with k_i = k_j. 103-110
  Electronic Edition (link) BibTeX
• Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
  New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles. 111-117
  Electronic Edition (link) BibTeX
• K. Ball:
  Completely Monotonic Rational Functions and Hall's Marriage Theorem. 118-124
  Electronic Edition (link) BibTeX
• Brendan D. McKay, Stanislaw P. Radziszowski:
  Linear Programming in Some Ramsey Problems. 125-132
  Electronic Edition (link) BibTeX
• Genghua Fan, André Raspaud:
  Fulkerson's Conjecture and Circuit Covers. 133-138
  Electronic Edition (link) BibTeX

Volume 61, Number 2, July 1994

• Bruce L. Bauslaugh:
  The Complexity of Infinite H-Coloring. 141-154
  Electronic Edition (link) BibTeX
• Lajos Takács:
  On the Total Heights of Random Rooted Binary Trees. 155-166
  Electronic Edition (link) BibTeX
• Rudolf Ahlswede, Ingo Althöfer:
  The Asymptotic Behavior of Diameters in the Average. 167-177
  Electronic Edition (link) BibTeX
• Mark N. Ellingham, Zhicheng Gao:
  Spanning Trees in Locally Planar Triangulations. 178-198
  Electronic Edition (link) BibTeX
• Péter Komjáth, E. C. Milner:
  On a Conjecture of Rödl and Voigt. 199-209
  Electronic Edition (link) BibTeX
• David W. Barnette:
  2-Connected Spanning Subgraphs of Planar 3-Connected Graphs. 210-216
  Electronic Edition (link) BibTeX
• Alexander Schrijver:
  Classification of Minimal Graphs of Given Face-Width on the Torus. 217-236
  Electronic Edition (link) BibTeX
• François Jaeger, Louis H. Kauffman, H. Saleur:
  The Conway Polynomial in R³ and in Thickened Surfaces: A New Determinant Formulation. 237-259
  Electronic Edition (link) BibTeX
• Reinhard Diestel:
  The Depth-First Search Tree Structure of TK_aleph0-Free Graphs. 260-262
  Electronic Edition (link) BibTeX
• András Frank, Zoltán Szigeti:
  On Packing T-Cuts. 263-271
  Electronic Edition (link) BibTeX