Journal of Combinatorial Theory, Series B, Volume 38

Volume 38, Number 1, February 1985

• F. T. Boesch, James A. M. McHugh:
  An edge extremal result for subcohesion. 1-7
  
• Martin Charles Golumbic, Robert E. Jamison:
  The edge intersection graphs of paths in a tree. 8-22
  
• Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
  Stability in CAN-free graphs. 23-30
  
• David W. Bange, Anthony E. Barkauskas, Peter J. Slater:
  A note on similar edges and edge-unique line graphs. 31-40
  
• Bernhard Korte, László Lovász:
  Polymatroid greedoids. 41-72
  
• Noga Alon, V. D. Milman:
  lambda₁, Isoperimetric inequalities for graphs, and superconcentrators. 73-88
  
• Alain Quilliot:
  A short note about pursuit games played on a graph with a given genus. 89-92
  
• Noga Alon, Yoshimi Egawa:
  Even edge colorings of a graph. 93-94
  

Volume 38, Number 2, April 1985

• Malaz Maamoun:
  Decompositions of digraphs into paths and cycles. 97-101
  
• Wolfgang Mader:
  Minimal n-fach zusammenhängende Digraphen. 102-117
  
• Bill Jackson:
  Long cycles in bipartite graphs. 118-131
  
• Richard P. Stanley:
  Reconstruction from vertex-switching. 132-138
  
• Charles H. C. Little, Derek A. Holton:
  No graph has a maximal 3-ring of bonds. 139-142
  
• Minoru Numata:
  On the graphical characterization of the projective space over a finite field. 143-155
  
• Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo:
  Interior graphs of maximal outerplane graphs. 156-167
  
• Brad Jackson, Gerhard Ringel:
  Heawood's empire problem. 168-178
  
• Michael Hager:
  Pendant tree-connectivity. 179-189
  
• C. R. J. Clapham:
  When a three-way fabric hangs together. 190
  

Volume 38, Number 3, June 1985

• Bojan Mohar, John Shawe-Taylor:
  Distance-biregular graphs with 2-valent vertices and distance-regular line graphs. 193-203
  
• Vojtech Rödl, Zsolt Tuza:
  On color critical graphs. 204-213
  
• Jozef Sirán, Martin Skoviera:
  Quotients of connected regular graphs of even degree. 214-225
  
• P. Hanlon:
  The chromatic polynomial of an unlabeled graph. 226-239
  
• Robin Thomas:
  Graphs without K₄ and well-quasi-ordering. 240-247
  
• Fan R. K. Chung, Paul Erdös, Joel H. Spencer:
  Extremal subgraphs for two graphs. 248-260
  
• Marie-Claude Heydemann, Dominique Sotteau:
  About some cyclic properties in digraphs. 261-278
  
• Derek A. Holton, Bennet Manvel, Brendan D. McKay:
  Hamiltonian cycles in cubic 3-connected bipartite planar graphs. 279-297