Combinatorica, Volume 9
Volume 9, Number 1, 1989
- V. P. Grishuhin: Cones of alternating and cut submodular set functions. 21-32
- Roland Häggkvist, Yannis Manoussakis: Cicles and paths in bipartite tournaments with spanning configurations. 33-38
- Tomasz Luczak, John C. Wierman: The chromatic number of random graphs at the double jump threshold. 39-49
- Arnold Neumaier: Duality in coherent configurations. 59-67
- Jean-Pierre Roudneff: Inseparability graphs of oriented matroids. 75-84
- Rodica Simion, D. S. Cao: Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching. 85-89
- Jerzy Wojciechowski: A new lower bound for snake-in-the-box codes. 91-99
- Ervin Györi: On the number of C5's in a triangle-free graph. 101-102
- Igor Kríz: A cycle-space invariant of the <2-distance-graph in the plane. 103-105
- Bernt Lindström: Matroids algebraic over F(t) are algebraic over F. 107-110
Volume 9, Number 2, 1989
- Alan M. Frieze: Survival time of a random graph. 133-143
- Hanno Lefmann: An extremal problem for Graham-Rotschild parameter words. 153-160
- Tom Leighton, Peter W. Shor: Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms. 161-187
- Emil Klafszky, Tamás Terlaky: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids. 189-198
- Lajos Rónyai: Factoring polynomials modulo special primes. 199-206
- A. F. Sidorenko: Asymptotic solution for a new class of forbidden r-graphs. 207-215
- Dobromir T. Todorov: Lower bounds for coverings of pairs by large blocks. 217-225
- Igor Kríz: A hypergraph-free construction of highly chromatic graph without short cycles. 227-229
- Jan Reiterman: A note on monotone paths in labeled graphs. 231-232
Volume 9, Number 3, 1989
- Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein: The size of chordal, interval and threshold subgraphs. 245-253
- A. V. Ivanov: Non rank 3 strongly regular graphs with the 5-vertex condition. 255-260
- David Lichtenstein, Nathan Linial, Michael E. Saks: Some extremal problems arising form discrete control processes. 269-287
Volume 9, Number 4, 1989
- Egon Balas, William R. Pulleyblank: The perfectly matchable subgraph polytope of an arbitrary graph. 321-337
- Alexander Schrijver: The Klein bottle and multicommodity flows. 375-384
- Gábor Tardos: Query complexity, or why is it difficult to seperate NP A cap co NPA from PA by random oracles A?. 385-392
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team