Combinatorica, Volume 14

Volume 14, Number 1, 1994

• Kathie Cameron, Horst Sachs:
  Monotone Path Systems in Simple Regions. 1-21
  
• Guoli Ding, Paul D. Seymour, Peter Winkler:
  Bounding the Vertex Cover Number of a Hypergraph. 23-34
  
• Craig Gotsman, Nathan Linial:
  Spectral Properties of Threshold Functions. 35-50
  
• Vikram Jha, Norman L. Johnson:
  A Characterisation of Spreads Ovally-Derived from Desarguesian Spreads. 51-61
  
• Gábor Korchmáros, Francesco Mazzocca:
  Nuclei of Point Sets of Size q+1 Contained in the Union of two Lines in PG(2, q). 63-69
  
• Vijay V. Vazirani:
  A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(sqrt{V E}) General Graph Maximum Matching Algorithm. 71-109
  

• Aart Blokhuis:
  On the Size of a Blocking Set in PG(2, p). 111-114
  
• Peter Frankl, M. Watanabe:
  Density Results for Uniform Families. 115-119
  
• Péter Komjáth, János Pach:
  The Complexity of a Class of Infinite Graphs. 121-125
  

Volume 14, Number 2, 1994

• Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
  Crossing Families. 127-134
  
• James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich:
  The Expressive Power of Voting Polynomials. 135-148
  
• Ronald D. Baker, Joseph E. Bonin, Felix Lazebnik, Eugenii Shustin:
  On the Number of Nowhere Zero Points in Linear Mappings. 149-157
  
• Mohamed M. El-Zahar, Norbert Sauer:
  On the Divisibility of Homogeneous Hypergraphs. 159-165
  
• Frank Thomson Leighton, Bruce M. Maggs, Satish Rao:
  Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps. 167-186
  
• Dragan Marusic, Raffaele Scapellato:
  Classifying Vertex-Transitive Graphs whose Order is a Product of two Primes. 187-201
  
• Pavel Pudlák:
  Communication in Bounded Depth Circuits. 203-216
  
• Paul D. Seymour, Robin Thomas:
  Call Routing and the Ratcatcher. 217-241
  

• Jørgen Bang-Jensen, Yannis Manoussakis:
  Cycles Through k Vertices in Bipartite Tournaments. 243-246
  

Volume 14, Number 3, 1994

• Loïc Allys:
  Minimally 3-Connected Isotropic Systems. 247-262
  
• Antal Balog, Endre Szemerédi:
  A Statistical Theorem of Set Addition. 263-268
  
• Vitaly Bergelson, Neil Hindman:
  On IP Sets and Central Sets. 269-277
  
• Béla Bollobás, Yoshiharu Kohayakawa:
  An Extension of the Erdös-Stone Theorem. 279-286
  
• Zoltán Füredi, Daniel J. Kleitman:
  The Prison Yard Problem. 287-300
  
• Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu:
  Every Arrangement Extends to a Spread. 301-306
  
• Kejie Ma, Huishan Zhou, Jianqin Zhou:
  On the Ascending Star Subgraph Decomposition of Star Forests. 307-320
  
• Sean McGuinness:
  Restricted Greedy Clique Decompositions and Greedy Clique Decompositions of K₄-Free Graphs. 321-334
  
• Sean McGuinness:
  Greedy Maximum-Clique Decompositions. 335-343
  
• Jaikumar Radhakrishnan:
  Sigma Pi Sigma Threshold Formulas. 345-374
  

• Dragomir Z. Dokovic:
  Two Hadamard Matrices of Order 956 of Goethals-Seidel Type. 375-377
  

Volume 14, Number 4, 1994

• Miklós Ajtai:
  Recursive Construction for 3-Regular Expanders. 379-416
  
• Miklós Ajtai:
  The Complexity of the Pigeonhole Principle. 417-433
  
• Joseph Cheriyan, John H. Reif:
  Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. 435-451
  
• Myung S. Chung, Douglas B. West:
  The p-Intersection Number of a Complete Bipartite Graph and Orthogonal Double Coverings of a Clique. 453-461
  
• Martin Klazar, Pavel Valtr:
  Generalized Davenport-Schinzel Sequences. 463-476
  
• Rögnvaldur G. Möller:
  Primitivity and Ends of Graphs. 477-484
  
• Imre Z. Ruzsa:
  Sum of Sets in Several Dimensions. 485-490
  
• Jerzy Wojciechowski:
  Covering the Hypercube with a Bounded Number of Disjoint Snakes. 491-496
  

Last update Tue Feb 14 04:15:30 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page