Journal of Combinatorial Theory, Series B, Volume 43

Volume 43, Number 1, August 1987

• Thomas Zaslavsky:
  Balanced decompositions of a signed graph. 1-13
  Electronic Edition (link) BibTeX
• Chris D. Godsil, John Shawe-Taylor:
  Distance-regularised graphs are distance-regular or distance-biregular. 14-24
  Electronic Edition (link) BibTeX
• Gary L. Miller:
  An additivity theorem for the genus of a graph. 25-47
  Electronic Edition (link) BibTeX
• R. Bruce Richter:
  On the non-orientable genus of a 2-connected graph. 48-59
  Electronic Edition (link) BibTeX
• R. Bruce Richter:
  On the Euler genus of a 2-connected graph. 60-69
  Electronic Edition (link) BibTeX
• Wen-Lian Hsu:
  Decomposition of perfect graphs. 70-94
  Electronic Edition (link) BibTeX
• A. Khelladi:
  Nowhere-zero integral chains and flows in bidirected graphs. 95-115
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  A characterization of locally finite vertex-transitive graphs. 116-119
  Electronic Edition (link) BibTeX

Volume 43, Number 2, October 1987

• Pierre Duchet:
  Parity graphs are kernel-M-solvable. 121-126
  Electronic Edition (link) BibTeX
• András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza:
  Local k-colorings of graphs and hypergraphs. 127-139
  Electronic Edition (link) BibTeX
• James W. Walker:
  Strict refinement for graphs and digraphs. 140-150
  Electronic Edition (link) BibTeX
• Alan Tucker:
  A reduction procedure for coloring perfect K₄-free graphs. 151-172
  Electronic Edition (link) BibTeX
• Douglas A. Miller:
  Oriented matroids from smooth manifolds. 173-186
  Electronic Edition (link) BibTeX
• László Lovász:
  Matching structure and the matching lattice. 187-222
  Electronic Edition (link) BibTeX
• B. Reed:
  A semi-strong Perfect Graph theorem. 223-240
  Electronic Edition (link) BibTeX
• Gadi Moran:
  A remark on embedded bipartite graphs. 241-243
  Electronic Edition (link) BibTeX

Volume 43, Number 3, December 1987

• Bill Jackson:
  A Chvátal-Erdös condition for hamilton cycles in digraphs. 245-252
  Electronic Edition (link) BibTeX
• Didier Arquès:
  Relations fonctionnelles et dénombrement des cartes pointées sur le tore. 253-274
  Electronic Edition (link) BibTeX
• Didier Arquès:
  Hypercartes pointées sur le tore: Décompositions et dénombrements. 275-286
  Electronic Edition (link) BibTeX
• Kouhei Asano:
  On the genus and thickness of graphs. 287-292
  Electronic Edition (link) BibTeX
• Hikoe Enomoto, R. A. Mena:
  Distance-regular digraphs of girth 4. 293-302
  Electronic Edition (link) BibTeX
• Ron Aharoni:
  Menger's theorem for countable graphs. 303-313
  Electronic Edition (link) BibTeX
• Brenda L. Dietrich:
  A circuit set characterization of antimatroids. 314-321
  Electronic Edition (link) BibTeX
• C. St. J. A. Nash-Williams:
  Amalgamations of almost regular edge-colourings of simple graphs. 322-342
  Electronic Edition (link) BibTeX
• Yahya Ould Hamidoune:
  A note on minimal directed graphs with given girth. 343-348
  Electronic Edition (link) BibTeX
• Vasek Chvátal:
  On the P₄-structure of perfect graphs III. Partner decompositions. 349-353
  Electronic Edition (link) BibTeX
• Ury Jamshy, André Raspaud, Michael Tarsi:
  Short circuit covers for regular matroids with a nowhere zero 5-flow. 354-357
  Electronic Edition (link) BibTeX
• Kazumasa Nomura:
  An inequality between intersection numbers of a distance-regular graph. 358-359
  Electronic Edition (link) BibTeX
• Chris D. Godsil, Ilia Krasikov, Yehuda Roditty:
  Reconstructing graphs from their k-edge deleted subgraphs. 360-363
  Electronic Edition (link) BibTeX