Discrete Applied Mathematics, Volume 54

Volume 54, Number 1, 1994

• Hernán G. Abeledo, Uriel G. Rothblum:
  Stable Matchings and Linear Inequalities. 1-27
  
• Gary MacGillivray:
  Graph Homomorphisms with Infinite Targets. 29-35
  
• David J. McClurkin:
  A Lower Bound for Tree Resolution. 37-53
  
• Jeffrey S. Salowe:
  Euclidean Spanner Graphs with Degree Four. 55-66
  
• Ioan Tomescu, Marius Zimand:
  Minimum Spanning Hypertrees. 67-76
  
• Alan M. Frieze, Michael Molloy:
  Broadcasting in Random Graphs. 77-79
  
• Rajeev Motwani, Madhu Sudan:
  Computing Roots of Graphs Is Hard. 81-88
  
• Marcos Valerio, Louise E. Moser, P. M. Melliar-Smith:
  Classic Squares and Broadcast Squares. 89-96
  

Volume 54, Number 2-3, 1994

• Hans L. Bodlaender:
  Improved Self-reduction Algorithms for Graphs with Bounded Treewidth. 101-115
  
• Bruno Courcelle:
  The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures. 117-149
  
• Dana L. Grinstead, Peter J. Slater:
  A Recurrence Template for Several Parameters in Series-parallel Graphs. 151-168
  
• Nancy G. Kinnersley, Michael A. Langston:
  obstruction Set Isolation for the Gate Matrix Layout Problem. 169-213
  
• N. M. Korneyenko:
  Combinatorial Algorithms on a Class of Graphs. 215-217
  
• Jens Lagergren:
  The Nonexistence of Reduction Rules Giving an Embedding into a K-tree. 219-223
  
• P. A. Macmahon:
  The Combinations of Resistances. 225-228
  
• Sanjeev Mahajan, Joseph G. Peters:
  Regularity and Locality in K-terminal Graphs. 229-250
  
• Egon Wanke:
  k-NLC Graphs and Polynomial Algorithms. 251-266
  
• Pawel Winter, Maciej M. Syslo:
  Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers. 267-280
  

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