Journal of Combinatorial Theory, Series B, Volume 24

Volume 24, Number 1, February 1978

• David W. Matula:
  k-Blocks and ultrablocks in graphs. 1-13
  
• Fan R. K. Chung, Ronald L. Graham:
  On graphs which contain all small trees. 14-23
  
• André Bouchet:
  Orientable and nonorientable genus of the complete bipartite graph. 24-33
  
• Dominique Bénard:
  Orientable imbedding of line graphs. 34-43
  
• J. C. Meyer:
  Nombre chromatique total d'un hypergraphe. 44-50
  
• J. A. Bondy:
  Extremal graphs with prescribed covering number. 51-52
  
• V. Krishnamoorthy, K. R. Parthasarathy:
  F-Sets in graphs. 53-60
  
• Vasek Chvátal, Carsten Thomassen:
  Distances in orientations of graphs. 61-75
  
• Armen H. Zemanian:
  The limb analysis of countably infinite electrical networks. 76-93
  
• Robert G. Bland, Michel Las Vergnas:
  Orientability of matroids. 94-123
  

Volume 24, Number 2, April 1978

• H. A. Jung:
  On a class of posets and the corresponding comparability graphs. 125-133
  
• Richard D. Ringeisen, Lowell W. Beineke:
  The crossing number of C₃ × C_n. 134-136
  
• Robert R. Korfhage:
  sigma-polynomials and graph coloring. 137-153
  
• V. Chungphaisan:
  Construction of hamiltonian graphs and bigraphs with prescribed degrees. 154-163
  
• A. Meir:
  On total covering and matching of graphs. 164-168
  
• Y. Shimamoto:
  On an extension of the Grinberg theorem. 169-180
  
• Kozo Bannai:
  Hamiltonian cycles in generalized petersen graphs. 181-188
  
• Dennis P. Geoffroy, David P. Sumner:
  The edge nucleus of a point-determining graph. 189-201
  
• Germain Kreweras:
  Complexité et circuits eulériens dans les sommes tensorielles de graphes. 202-212
  
• Ronald L. Graham, Endre Szemerédi:
  On subgraph number independence in trees. 213-222
  
• Vladimír Müller, Jan Pelant:
  The number of Hamiltonian circuits. 223-227
  
• Michael Burstein:
  Kuratowski-Pontrjagin theorem on planar graphs. 228-232
  
• Ernest J. Cockayne, Stephen T. Hedetniemi:
  Disjoint cliques in regular graphs of degree seven and eight. 233-237
  
• Alvin E. Roth:
  Two-person games on graphs. 238-241
  
• Chong-Keang Lim:
  On graphical regular representations of direct products of groups. 242-246
  
• Steve Fisk:
  The nonexistence of colorings. 247-248
  
• Anthony J. W. Hilton, Rhys Price Jones:
  Further remarks on partitioning the edges of a graph. 249-250
  

Volume 24, Number 3, June 1978

• Henry Meyniel:
  Les 5-colorations d'un graphe planaire forment une classe de commutation unique. 251-257
  
• John Philip Huneke:
  A minimum-vertex triangulation. 258-266
  
• Alwin C. Green:
  Connectedness and classification of certain graphs. 267-285
  
• D. T. Busolini:
  On a problem of C. C. Chen and D. E. Daykin. 286-289
  
• H. Hadwiger, D. G. Larman, P. Mani:
  Hyperrhombs inscribed to concex bodies. 290-293
  
• Alan P. Sprague:
  Characterization of projective graphs. 294-300
  
• A. Gardiner:
  Homogeneity conditions in graphs. 301-310
  
• Richard C. Bradley:
  A remark on noncolorable cubic graphs. 311-317
  
• Pierre Martin:
  Remarkable valuation of the dichromatic polynomial of planar multigraphs. 318-324
  
• Jack L. Hursch:
  On path factors in certain graphs of mixed degree 2 and 3. 325-330
  
• Clement W. H. Lam, Jack H. van Lint:
  Directed graphs with unique paths of fixed length. 331-337
  
• Peter J. Slater:
  Soldering and point splitting. 338-343
  
• Takao Nishizeki, Nobuji Saito:
  Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade. 344-361
  
• S. Ramachandran:
  Planar graphs with square or cube root are four-colorable. 362-364
  
• D. T. Busolini:
  2-Colored triangles in edge-colored complete graphs. 365-366
  
• Bernt Lindström:
  On the chromatic number of regular matroids. 367-369
  
• E. M. Wright:
  Asymptotic formulas for the number of oriented graphs. 370-373
  
• Steve Fisk:
  A short proof of Chvátal's Watchman Theorem. 374