Journal of Combinatorial Theory, Series B, Volume 48

Volume 48, Number 1, February 1990

• Nathaniel Dean:
  Distribution of contractible edges in k-connected graphs. 1-5
  Electronic Edition (link) BibTeX
• David N. Yetter:
  On graph invariants given by linear recurrence relations. 6-18
  Electronic Edition (link) BibTeX
• Chris D. Godsil, Brendan D. McKay:
  Asymptotic enumeration of Latin rectangles. 19-44
  Electronic Edition (link) BibTeX
• Amanda G. Chetwynd, Anthony J. W. Hilton:
  The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small. 45-66
  Electronic Edition (link) BibTeX
• Robin Thomas:
  A menger-like property of tree-width: The finite case. 67-76
  Electronic Edition (link) BibTeX
• C. P. M. van Hoesel, Alexander Schrijver:
  Edge-disjoint homotopic paths in a planar graph with one hole. 77-91
  Electronic Edition (link) BibTeX
• Pavol Hell, Jaroslav Nesetril:
  On the complexity of H-coloring. 92-110
  Electronic Edition (link) BibTeX
• Douglas Bauer, Edward F. Schmeichel:
  Hamiltonian degree conditions which imply a graph is pancyclic. 111-116
  Electronic Edition (link) BibTeX
• Colin Cooper, Alan M. Frieze:
  The limiting probability that alpha-in, ß-out is strongly connected. 117-134
  Electronic Edition (link) BibTeX
• Ryan B. Hayward, William J. Lenhart:
  On the P₄-structure of Perfect Graphs. IV. Partner graphs. 135-139
  Electronic Edition (link) BibTeX
• Ingo Althöfer:
  Average distances in undirected graphs and the removal of vertices. 140-142
  Electronic Edition (link) BibTeX

Volume 48, Number 2, April 1990

• Louis H. Kauffman:
  Map coloring and the vector cross product. 145-154
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Embeddings of graphs with no short noncontractible cycles. 155-177
  Electronic Edition (link) BibTeX
• Minoru Numata:
  A characterization of Grassmann and Johnson graphs. 178-190
  Electronic Edition (link) BibTeX
• Douglas A. Leonard:
  Directed distance regular graphs with the Q-polynomial property. 191-196
  Electronic Edition (link) BibTeX
• Reinhard Diestel:
  Simplicial tree-decompositions of infinite graphs, I. 197-215
  Electronic Edition (link) BibTeX
• Yannis Manoussakis:
  k-Linked and k-cyclic digraphs. 216-226
  Electronic Edition (link) BibTeX
• Neil Robertson, Paul D. Seymour:
  Graph minors. IV. Tree-width and well-quasi-ordering. 227-254
  Electronic Edition (link) BibTeX
• Neil Robertson, Paul D. Seymour:
  Graph minors. VIII. A kuratowski theorem for general surfaces. 255-288
  Electronic Edition (link) BibTeX
• Lajos Takács:
  A generalization of an inequality of Stepanov. 289-293
  Electronic Edition (link) BibTeX