Journal of Combinatorial Theory, Series B, Volume 30

Volume 30, Number 1, February 1981

• Yahya Ould Hamidoune:
  Quelques problèmes de connexité dans les graphes orientés. 1-10
  
• Richard P. Anstee:
  An analogue of group divisible designs for Moore graphs. 11-20
  
• Daniel A. Marcus:
  Spanning subgraphs of k-connected digraphs. 21-31
  
• Peter Hammond:
  q-Coverings, codes, and line graphs. 32-35
  
• Carsten Thomassen:
  Planar cubic hypohamiltonian and hypotraceable graphs. 36-44
  
• David G. Kirkpatrick, Derek G. Corneil:
  Forest embeddings in regular graphs of large girth. 45-60
  
• Martin Feinberg:
  On a generalization of linear independence in finite-dimensional vector spaces. 61-69
  
• Charles Grinstead:
  The strong perfect graph conjecture for toroifal graphs. 70-74
  
• Dominique Sotteau:
  Decomposition of K_{m, n}(K_{m, n}^*) into cycles (circuits) of length 2k. 75-81
  
• Kenneth A. Berman:
  Three-colourings of planar 4-valent maps. 82-88
  
• E. M. Wright:
  Burnside's lemma: A historical note. 89-90
  
• D. Perrin, Marcel Paul Schützenberger:
  A conjecture on sets of differences of integer pairs. 91-93
  
• William H. Cunningham:
  On matroid connectivity. 94-99
  
• François Bry:
  Note on a theorem of J. Folkman on transversals of infinite families with finitely many infinite members. 100-102
  
• C. Zaverdinos:
  Hall-conditions and the three-family problem. 103-107
  
• Yahya Ould Hamidoune:
  On multiply critically h-connected graphs. 108-112
  
• Jochen Harant, Hansjoachim Walther:
  On the radius of graphs. 113-117
  
• Roland Häggkvist, G. G. Nicoghossian:
  A remark on Hamiltonian cycles. 118-120
  

Volume 30, Number 2, April 1981

• Edward F. Schmeichel:
  The basis number of a graph. 123-129
  
• Paul D. Seymour:
  Nowhere-zero 6-flows. 130-135
  
• W. G. Bridges, R. A. Mena:
  X^k-Digraphs. 136-143
  
• John B. Kelly:
  Difference systems, graph designs, and coloring problems. 144-165
  
• N. Gaffke:
  Connected graphs with a minimal number of spanning trees. 166-183
  
• Dana Angluin, A. Gardiner:
  Finite common coverings of pairs of regular graphs. 184-187
  
• S. Fiorini, Josef Lauri:
  The reconstruction of maximal planar graphs. I. Recognition. 188-195
  
• Josef Lauri:
  The reconstruction of maximal planar graphs II. Reconstruction. 196-214
  
• Hikoe Enomoto:
  Combinatorially homogeneous graphs. 215-223
  
• Béla Bollobás, Paul A. Catlin:
  Topological cliques of random graphs. 224-227
  
• F. E. Bennett, Dominique Sotteau:
  Almost resolvable decomposition of K_n^*. 228-232
  
• Tom Brylawski:
  Intersection theory for graphs. 233-246
  
• Allen J. Schwenk:
  On unimodal sequences of graphical invariants. 247-250
  

Volume 30, Number 3, June 1981

• Sóstenes Lins:
  A minimax theorem on circuits in projective graphs. 253-262
  
• Béla Bollobás, D. L. Goldsmith, Douglas R. Woodall:
  Indestructive deletions of edges from graphs. 263-275
  
• Gena Hahn:
  The automorphism group of a product of hypergraphs. 276-281
  
• Peter Kovács:
  The non-existence of certain regular graphs of girth 5. 282-284
  
• Chris D. Godsil, Brendan D. McKay:
  Spectral conditions for the reconstructibility of a graph. 285-289
  
• R. H. Jeurissen:
  The incidence matrix and labelings of a graph. 290-301
  
• W. A. Denig:
  A class of matroids derived from saturated chain partitions of partially ordered sets. 302-317
  
• Arnold Neumaier:
  Classification of graphs by regularity. 318-331
  
• Bill Jackson:
  Cycles in bipartite graphs. 332-342
  
• Kenneth A. Berman:
  Matchings and spanning trees in Boolean weighted graphs. 343-350
  
• M. E. Adams, Jaroslav Nesetril, J. Sichler:
  Quotients of rigid graphs. 351-359
  
• D. T. Busolini:
  2-Colored triangles in edge-colored complete graphs, II. 360-363
  
• R. J. Evans, J. R. Pulham, J. Sheehan:
  On the number of complete subgraphs contained in certain graphs. 364-371
  

Last update Mon May 20 01:13:49 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page