Journal of Combinatorial Theory, Series B, Volume 44

Volume 44, Number 1, February 1988

• Alain Quilliot:
  On the problem of how to represent a graph taking into account an additional structure. 1-21
  Electronic Edition (link) BibTeX
• Richard P. Anstee, Martin Farber:
  On bridged graphs and cop-win graphs. 22-28
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  Embeddings of infinite graphs. 29-43
  Electronic Edition (link) BibTeX
• Charles H. C. Little:
  Cubic combinatorial maps. 44-63
  Electronic Edition (link) BibTeX
• Gary Gordon:
  Algebraic characteristic sets of matroids. 64-74
  Electronic Edition (link) BibTeX
• Peter Horák:
  Subgraphs intersecting any hamiltonian cycle. 75-86
  Electronic Edition (link) BibTeX
• Ron Aharoni:
  Matchings in infinite graphs. 87-125
  Electronic Edition (link) BibTeX

Volume 44, Number 2, April 1988

• François Jaeger:
  On Tutte polynomials and cycles of plane graphs. 127-146
  Electronic Edition (link) BibTeX
• Alan Boshier, Kazumasa Nomura:
  A remark on the intersection arrays of distance-regular graphs. 147-153
  Electronic Edition (link) BibTeX
• Vasek Chvátal, Najiba Sbihi:
  Recognizing claw-free perfect graphs. 154-176
  Electronic Edition (link) BibTeX
• J. A. Bondy, Mekkia Kouider:
  Hamilton cycles in regular 2-connected graphs. 177-186
  Electronic Edition (link) BibTeX
• W. L. Kocay:
  Hypomorphisms, orbits, and reconstruction. 187-200
  Electronic Edition (link) BibTeX
• Alan Cheung, Henry Crapo:
  On relative position in extensions of combinatorial geometries. 201-229
  Electronic Edition (link) BibTeX
• Alan M. Frieze:
  Finding hamilton cycles in sparse random graphs. 230-250
  Electronic Edition (link) BibTeX

Volume 44, Number 3, June 1988

• Péter Komjáth, E. C. Milner, Norbert Polat:
  A compactness theorem for perfect matchings in matroids. 253-262
  Electronic Edition (link) BibTeX
• Massimo Ferri, Carlo Gagliardi:
  Multiple residues in dimension three. 263-275
  Electronic Edition (link) BibTeX
• Seiya Negami:
  Re-embedding of projective-planar graphs. 276-299
  Electronic Edition (link) BibTeX
• Jeremy Spinrad:
  Circular-arc graphs with clique cover number two. 300-306
  Electronic Edition (link) BibTeX
• Pierre Duchet:
  Convex sets in graphs, II. Minimal path convexity. 307-316
  Electronic Edition (link) BibTeX
• Peter Frankl, Vojtech Rödl, Richard M. Wilson:
  The number of submatrices of a given type in a Hadamard matrix and related results. 317-328
  Electronic Edition (link) BibTeX
• Michael D. Plummer:
  Matching extension and the genus of a graph. 329-337
  Electronic Edition (link) BibTeX
• Martin Loebl, Svatopluk Poljak:
  On matroids induced by packing subgraphs. 338-354
  Electronic Edition (link) BibTeX
• Peter Frankl, Hiroshi Maehara:
  The Johnson-Lindenstrauss lemma and the sphericity of some graphs. 355-362
  Electronic Edition (link) BibTeX
• Edward A. Bender, Robert W. Robinson:
  The asymptotic number of acyclic digraphs, II. 363-369
  Electronic Edition (link) BibTeX
• Yahya Ould Hamidoune, Michel Las Vergnas:
  Local edge-connectivity in regular bipartite graphs. 370-371
  Electronic Edition (link) BibTeX
• Dean G. Hoffman, Christopher A. Rodger:
  Class one graphs. 372-376
  Electronic Edition (link) BibTeX