Journal of Combinatorial Theory, Series B, Volume 21

Volume 21, Number 1, August 1976

• Béla Bollobás:
  Complete subgraphs are elusive. 1-7
  
• Gideon Ehrlich, Shimon Even, Robert Endre Tarjan:
  Intersection graphs of curves in the plane. 8-20
  
• J. M. S. Simões-Pereira:
  Joins of n-degenerate graphs and uniquely (m, n)-partitionable graphs. 21-29
  
• C. R. Platt:
  Planar lattices and planar graphs. 30-39
  
• Klaus-Peter Podewski, Karsten Steffens:
  Injective choice functions for countable families. 40-46
  
• Mark E. Watkins:
  Graphical regular representations of free products of groups. 47-56
  
• Dominique de Werra:
  Some remarks on good colorations. 57-64
  
• Peter C. Fishburn:
  On linear extension majority graphs of partial orders. 65-70
  
• John W. Moon:
  A problem on arcs without bypasses in tournaments. 71-75
  
• Maria Overbeck-Larisch:
  Hamiltonian paths in oriented graphs. 76-80
  
• L. Bruce Richmond:
  On Hamiltonian polygons. 81-87
  
• Daniel J. Kleitman:
  A note on the parity of the number of crossings of a graph. 88-89
  
• J. C. Arditti, Dominique de Werra:
  A note on a paper by D. Seinsche. 90
  

Volume 21, Number 2, October 1976

• Judith Q. Longyear:
  Some isomorphisms between pairs of latin squares. 91-95
  
• László Lovász:
  On two minimax theorems in graph. 96-103
  
• Lou Caccetta:
  Extremal graphs of diameter 4. 104-115
  
• Joseph Zaks:
  Pairs of Hamiltonian circuits in 5-connected planar graphs. 116-131
  
• Douglas R. Woodall:
  A note on a problem of Halin's. 132-134
  
• C. C. Chen, David E. Daykin:
  Graphs with Hamiltonian cycles having adjacent lines different colors. 135-139
  
• Richard K. Guy, Gerhard Ringel:
  Triangular imbedding of K_n - K₆. 140-145
  
• Jean-Claude Bermond, V. Faber:
  Decomposition of the complete directed graph into k-circuits. 146-155
  
• Bennet Manvel:
  On reconstructing graphs from their sets of subgraphs. 156-165
  
• Béla Bollobás, Paul Erdös:
  On a Ramsey-Turán type problem. 166-168
  
• Bruce Auerbach, Renu Laskar:
  Some coloring numbers for complete r-partite graphs. 169-170
  
• Biswa Tosh Datta:
  Nonexistence of six-dimensional tangential 2-blocks. 171-193
  

Volume 21, Number 3, 1976

• M. Behzad, H. Radjavi:
  Chromatic numbers of infinite graphs. 195-200
  
• Béla Bollobás, Stephen E. Eldridge:
  On graphs with diameter 2. 201-205
  
• F. Jaeger:
  On parity patterns of even Q-Angulations. 206-211
  
• K. R. Parthasarathy, G. Ravindra:
  The strong perfect-graph conjecture is true for K_{1, 3}-free graphs. 212-223
  
• Michael Koren:
  Pairs of sequences with a unique realization by bipartite graphs. 224-234
  
• Michael Koren:
  Sequences with a unique realization by simple graphs. 235-244
  
• Lowell W. Beineke, Robert L. Hemminger:
  Infinite digraphs isomorphic with their line digraphs. 245-256
  
• Dominique Bénard, André Bouchet:
  Some cases of triangular imbeddings for K_n(m). 257-269
  
• Detlef Wille:
  Asymptotic formulas for the number of oriented graphs. 270-274
  
• Richard Weiss:
  Glatt einbettbare untergraphen. 275-281
  
• David Merriell:
  A note on uniquely reducible graphs. 282-284