Journal of Combinatorial Theory, Series B, Volume 49

Volume 49, Number 1, June 1990

• Vasek Chvátal, William J. Lenhart, Najiba Sbihi:
  Two-colourings that decompose perfect graphs. 1-9
  Electronic Edition (link) BibTeX
• András Sebö:
  Undirected distances and the postman-structure of graphs. 10-39
  Electronic Edition (link) BibTeX
• Neil Robertson, Paul D. Seymour:
  Graph minors. IX. Disjoint crossed paths. 40-77
  Electronic Edition (link) BibTeX
• Geoffrey P. Whittle:
  Quotients of dilworth truncations. 78-86
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Resistances and currents in infinite electrical networks. 87-102
  Electronic Edition (link) BibTeX
• Daniel Bienstock:
  On embedding graphs in trees. 103-136
  Electronic Edition (link) BibTeX
• Genghua Fan:
  Covering weighted graphs by even subgraphs. 137-141
  Electronic Edition (link) BibTeX

Volume 49, Number 2, August 1990

• Joseph Zaks:
  On the connectedness of some geometric graphs. 143-150
  Electronic Edition (link) BibTeX
• Genghua Fan:
  Long cycles and the codiameter of a graph, I. 151-180
  Electronic Edition (link) BibTeX
• James G. Oxley:
  A characterization of a class of non-binary matroids. 181-189
  Electronic Edition (link) BibTeX
• N. L. Biggs, A. G. Boshier:
  Note on the girth of Ramanujan graphs. 190-194
  Electronic Edition (link) BibTeX
• Michel Las Vergnas:
  Acyclic reorientations of weakly oriented matroids. 195-199
  Electronic Edition (link) BibTeX
• Ryan B. Hayward:
  Murky graphs. 200-235
  Electronic Edition (link) BibTeX
• K. S. Sarkaria:
  A generalized kneser conjecture. 236-240
  Electronic Edition (link) BibTeX
• Klaus Truemper:
  A decomposition theory for matroids. V. Testing of matrix total unimodularity. 241-281
  Electronic Edition (link) BibTeX
• Chính T. Hoàng:
  On the sibling-structure of perfect graphs. 282-286
  Electronic Edition (link) BibTeX
• A. S. Hasratian, N. K. Khachatrian:
  Some localization theorems on hamiltonian circuits. 287-294
  Electronic Edition (link) BibTeX
• Ilia Krasikov:
  A note on the edge-reconstruction of K_{1, m}-free graphs. 295-298
  Electronic Edition (link) BibTeX