Journal of Combinatorial Theory, Series B, Volume 51

Volume 51, Number 1, January 1991

• Jørgen Bang-Jensen:
  Edge-disjoint in- and out-branchings in tournaments and related path problems. 1-23
  
• Anna Lubiw:
  Short-chorded and perfect graphs. 24-33
  
• Hans-Jürgen Bandelt, Erich Prisner:
  Clique graphs and Helly graphs. 34-45
  
• Thomas Zaslavsky:
  Biased graphs. II. The three matroids. 46-72
  
• David A. Gregory, Norman J. Pullman, Kathryn F. Jones, J. Richard Lundgren:
  Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices. 73-89
  
• Paul Erdös, András Gyárfás, László Pyber:
  Vertex coverings by monochromatic cycles and trees. 90-95
  
• Anders Björner, Günter M. Ziegler:
  Broken circuit complexes: Factorizations and generalizations. 96-126
  
• Alexander Schrijver:
  Disjoint circuits of prescribed homotopies in a graph on a compact surface. 127-159
  

Volume 51, Number 2, March 1991

• Alexander Schrijver:
  Decomposition of graphs on surfaces and a homotopic circulation theorem. 161-210
  
• Manoel Lemos:
  K-Elimination property for circuits of matroids. 211-226
  
• Massimo Ferri, Sóstenes Lins:
  Topological aspects of edge fusions in 4-graphs. 227-243
  
• Douglas A. Leonard:
  Non-symmetric, metric, cometric association schemes are self-dual. 244-247
  
• Norbert Polat:
  A mengerian theorem for infinite graphs with ideal points. 248-255
  
• Hubertus Th. Jongen, P. Jonker, F. Twilt:
  On the classification of plane graphs representing structurally stable rational Newton flows. 256-270
  
• Cor A. J. Hurkens:
  On the diameter of the edge cover polytope. 271-276
  
• David W. Barnette:
  Generating projective plane polyhedral maps. 277-291
  
• George R. T. Hendry:
  Extending cycles in bipartite graphs. 292-313
  
• Akihiro Munemasa:
  On nonsymmetric P- and Q-polynomial association schemes. 314-328
  

Last update Thu May 23 19:07:25 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page