Journal of Combinatorial Theory, Series B, Volume 50

Volume 50, Number 1, October 1990

• Ron Aharoni, E. C. Milner, Karel Prikry:
  Unfriendly partitions of a graph. 1-10
  Electronic Edition (link) BibTeX
• Yves Colin de Verdière:
  Sur un nouvel invariant des graphes et un critère de planarité. 11-21
  Electronic Edition (link) BibTeX
• Myriam Preissmann:
  Locally perfect graphs. 22-40
  Electronic Edition (link) BibTeX
• Joseph P. S. Kung:
  The long-line graph of a combinatorial geometry. II. Geometries representable over two fields of different characteristics. 41-53
  Electronic Edition (link) BibTeX
• Gil Kalai:
  Symmetric matroids. 54-64
  Electronic Edition (link) BibTeX
• Luis A. Goddyn:
  Quantizers and the worst-case Euclidean traveling salesman problem. 65-81
  Electronic Edition (link) BibTeX
• Ron Aharoni, Ran Ziv:
  LP duality in infinite hypergraphs. 82-92
  Electronic Edition (link) BibTeX
• Reinhard Diestel:
  Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. 93-116
  Electronic Edition (link) BibTeX
• Reinhard Diestel:
  Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. 117-128
  Electronic Edition (link) BibTeX
• Feng-Chu Lai, Gerard J. Chang:
  An upper bound for the transversal numbers of 4-uniform hypergraphs. 129-133
  Electronic Edition (link) BibTeX

Volume 50, Number 2, December 1990

• David B. Surowski:
  Lifting map automorphisms and MacBeath's theorem. 135-149
  Electronic Edition (link) BibTeX
• Éva Tardos:
  An intersection theorem for supermatroids. 150-159
  Electronic Edition (link) BibTeX
• Kazumasa Nomura:
  Distance-regular graphs of hamming type. 160-167
  Electronic Edition (link) BibTeX
• Ron Aharoni, Mao Lin Zheng:
  Counting 1-factors in infinite graphs. 168-178
  Electronic Edition (link) BibTeX
• Elke Wilkeit:
  Isometric embeddings in Hamming graphs. 179-197
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Bidirectional retracting-free double tracings and upper embeddability of graphs. 198-207
  Electronic Edition (link) BibTeX
• Marion Alfter, Walter Kern, Alfred Wanka:
  On adjoints and dual matroids. 208-213
  Electronic Edition (link) BibTeX
• Kazumasa Nomura:
  Intersection diagrams of distance-biregular graphs. 214-221
  Electronic Edition (link) BibTeX
• Marc E. Bertschi:
  Perfectly contractile graphs. 222-230
  Electronic Edition (link) BibTeX
• Alain Hertz:
  A fast algorithm for coloring Meyniel graphs. 231-240
  Electronic Edition (link) BibTeX
• Yahya Ould Hamidoune:
  On the numbers of independent k-sets in a claw free graph. 241-244
  Electronic Edition (link) BibTeX
• Herbert Fleischner, András Frank:
  On circuit decomposition of planar Eulerian graphs. 245-253
  Electronic Edition (link) BibTeX
• Denise Amar, Yannis Manoussakis:
  Cycles and paths of many lengths in bipartite digraphs. 254-264
  Electronic Edition (link) BibTeX
• Jon Lee:
  The incidence structure of subspaces with well-scaled frames. 265-287
  Electronic Edition (link) BibTeX
• Li Jiongsheng, Huang Daode, Pan Qun:
  Digraphs with degree equivalent induced subdigraphs. 288-298
  Electronic Edition (link) BibTeX
• W. Bienia, I. P. da Silva:
  On the inversion of the sign of one basis in an oriented matroid. 299-308
  Electronic Edition (link) BibTeX
• Béla Bollobás, Roland Häggkvist:
  Powers of Hamilton cycles in tournaments. 309-318
  Electronic Edition (link) BibTeX
• Shaoji Xu:
  The size of uniquely colorable graphs. 319-320
  Electronic Edition (link) BibTeX
• Peter Horák:
  A coloring problem related to the Erdös-Faber-Lovász conjecture. 321-322
  Electronic Edition (link) BibTeX