Journal of Combinatorial Theory, Series B, Volume 52

Volume 52, Number 1, May 1991

• Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang, X. M. Zhang:
  The Hamiltonian property of generalized de Bruijn digraphs. 1-8
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton:
  The total chromatic number of nearly complete bipartite graphs. 9-19
  Electronic Edition (link) BibTeX
• Yoshimi Egawa, R. Glas, Stephen C. Locke:
  Cycles and paths through specified vertices in k-connected graphs. 20-29
  Electronic Edition (link) BibTeX
• Gena Hahn, Eric C. Milner, Robert E. Woodrow:
  Infinite friendship graphs with infinite parameters. 30-41
  Electronic Edition (link) BibTeX
• Bert Fassbender:
  On a generalization of a theorem of Nash-Williams. 42-44
  Electronic Edition (link) BibTeX
• Jason I. Brown, Vojtech Rödl:
  A ramsey type problem concerning vertex colourings. 45-52
  Electronic Edition (link) BibTeX
• Jan Kratochvíl:
  String graphs. I. The number of critical nonstring graphs is infinite. 53-66
  Electronic Edition (link) BibTeX
• Jan Kratochvíl:
  String graphs. II. recognizing string graphs is NP-hard. 67-78
  Electronic Edition (link) BibTeX
• Yair Caro, Zsolt Tuza:
  Hypergraph coverings and local colorings. 79-85
  Electronic Edition (link) BibTeX
• Igor Kríz, Robin Thomas:
  The menger-like property of the tree-width of infinite graphs. 86-91
  Electronic Edition (link) BibTeX
• Zsolt Tuza:
  Extensions of Gallai's graph covering theorems for uniform hypergraphs. 92-96
  Electronic Edition (link) BibTeX
• Jaroslav Ivanco:
  An interpolation theorem for partitions which are indivisible with respect to cohereditary properties. 97-101
  Electronic Edition (link) BibTeX
• Miroslav Petrovic:
  On graphs with exactly one eigenvalue less than -1. 102-112
  Electronic Edition (link) BibTeX
• Rephael Wenger:
  Extremal graphs with no C⁴'s, C⁶'s, or C¹⁰'s. 113-116
  Electronic Edition (link) BibTeX
• Stanislav Riha:
  A new proof of the theorem by Fleischner. 117-123
  Electronic Edition (link) BibTeX
• Jozef Sirán, Martin Skoviera:
  Characterization of the maximum genus of a signed graph. 124-146
  Electronic Edition (link) BibTeX
• Alice M. Dean, Joan P. Hutchinson, Edward R. Scheinerman:
  On the thickness and arboricity of a graph. 147-151
  Electronic Edition (link) BibTeX

Volume 52, Number 2, July 1991

• Neil Robertson, Paul D. Seymour:
  Graph minors. X. Obstructions to tree-decomposition. 153-190
  Electronic Edition (link) BibTeX
• Saul Stahl:
  Permutation-partition pairs. III. Embedding distributions of linear families of graphs. 191-218
  Electronic Edition (link) BibTeX
• Saul Stahl:
  An upper bound for the average number of regions. 219-221
  Electronic Edition (link) BibTeX
• Norbert Seifter:
  Properties of graphs with polynomial growth. 222-235
  Electronic Edition (link) BibTeX
• Zhi-Cheng Gao:
  The number of rooted triangular maps on a surface. 236-249
  Electronic Edition (link) BibTeX
• Haluk Oral:
  Constructing self-dual codes using graphs. 250-258
  Electronic Edition (link) BibTeX
• François Jaeger:
  Even subgraph expansions for the flow polynomial of cubic plane maps. 259-273
  Electronic Edition (link) BibTeX
• Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas:
  Quickly excluding a forest. 274-283
  Electronic Edition (link) BibTeX
• Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian:
  On multipartite tournaments. 284-300
  Electronic Edition (link) BibTeX
• Safwan Akkari, James G. Oxley:
  Some extremal connectivity results for matroids. 301-320
  Electronic Edition (link) BibTeX