Journal of Combinatorial Theory, Series B, Volume 40

Volume 40, Number 1, February 1986

• Fuji Zhang, Xiaofeng Guo:
  Hamilton cycles in Euler tour graph. 1-8
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Interval representations of planar graphs. 9-20
  Electronic Edition (link) BibTeX
• Martin Farber, Gena Hahn, Pavol Hell, Donald Miller:
  Concerning the achromatic number of graphs. 21-39
  Electronic Edition (link) BibTeX
• Francisco Barahona, Martin Grötschel:
  On the cycle polytope of a binary matroid. 40-62
  Electronic Edition (link) BibTeX
• William J. Cook, Jean Fonlupt, Alexander Schrijver:
  An integer analogue of Carathéodory's theorem. 63-70
  Electronic Edition (link) BibTeX
• Larry Eggan, Michael Plantholt:
  The chromatic index of nearly bipartite multigraphs. 71-80
  Electronic Edition (link) BibTeX
• Walter Vogler:
  Representing abstract groups by powers of a graph. 81-93
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  A common cover of graphs and 2-cell embeddings. 94-106
  Electronic Edition (link) BibTeX
• Dave Witte:
  Cayley digraphs of prime-power order are hamiltonian. 107-112
  Electronic Edition (link) BibTeX
• Herbert S. Wilf:
  Spectral bounds for the clique and independence numbers of graphs. 113-117
  Electronic Edition (link) BibTeX

Volume 40, Number 2, April 1986

• Edwin C. Ihrig:
  Symmetry groups related to the construction of perfect one factorizations of K_2n. 121-151
  Electronic Edition (link) BibTeX
• Wolfgang Mader:
  Kritisch n-fach kantenzusammenhängende Graphen. 152-158
  Electronic Edition (link) BibTeX
• Robin W. Dawes:
  Minimally 3-connected graphs. 159-168
  Electronic Edition (link) BibTeX
• Ying Cheng, Albert L. Wells Jr.:
  Switching classes of directed graphs. 169-186
  Electronic Edition (link) BibTeX
• Geoffrey R. Grimmett:
  An exact threshold theorem for random graphs and the node-packing problem. 187-195
  Electronic Edition (link) BibTeX
• Alan M. Frieze:
  Maximum matchings in a class of random graphs. 196-212
  Electronic Edition (link) BibTeX
• Paul Terwilliger:
  A class of distance-regular graphs that are Q-polynomial. 213-223
  Electronic Edition (link) BibTeX
• Jan Kratochvíl:
  Perfect codes over graphs. 224-228
  Electronic Edition (link) BibTeX
• Herbert Fleischner:
  Proof of the strong 2-Cover Conjecture for planar graphs. 229-230
  Electronic Edition (link) BibTeX
• Hiroshi Maehara:
  Sphericity exceeds cubicity for almost all complete bipartite graphs. 231-235
  Electronic Edition (link) BibTeX

Volume 40, Number 3, June 1986

• Yahya Ould Hamidoune, Michel Las Vergnas:
  Directed Switching Games on graphs and matroids. 237-269
  Electronic Edition (link) BibTeX
• Peter Frankl, Zoltán Füredi:
  Extremal problems concerning Kneser graphs. 270-284
  Electronic Edition (link) BibTeX
• Gérard Cornuéjols, David Hartvigsen:
  An extension of matching theory. 285-296
  Electronic Edition (link) BibTeX
• Edward A. Bender, L. Bruce Richmond:
  A survey of the asymptotic behaviour of maps. 297-329
  Electronic Edition (link) BibTeX
• Martin Grötschel, László Lovász, Alexander Schrijver:
  Relaxations of vertex packing. 330-343
  Electronic Edition (link) BibTeX
• Peter J. Cameron, Albert L. Wells Jr.:
  Signatures and signed switching classes. 344-361
  Electronic Edition (link) BibTeX
• Marston Conder:
  A note on Cayley graphs. 362-368
  Electronic Edition (link) BibTeX