Discrete Mathematics, Volume 95

Volume 95, Numbers 1-3, December 1991

• Reinhard Diestel:
  Preface. 1
  
• C. St. J. A. Nash-Williams: Introduction. 3-4
• Ron Aharoni:
  Infinite matching theory. 5-22
  
• J.-M. Brochet, M. Pouzet:
  Gallai-Milgram properties for infinite graphs. 23-47
  
• Peter J. Cameron:
  The age of a relational structure. 49-67
  
• Reinhard Diestel:
  Decomposing infinite graphs. 69-89
  
• Rudolf Halin:
  Bounded graphs. 91-99
  
• Wilfried Imrich, Norbert Seifter:
  A survey on graphs with polynomial growth. 101-117
  
• H. A. Jung:
  Some results on ends and automorphisms of graphs. 119-133
  
• Igor Kríz, Robin Thomas:
  Analyzing Nash-Williams' partition theorem by means of ordinal types. 135-167
  
• Paul Erdös, Jean A. Larson:
  Matchings from a set below to a set above. 169-182
  
• E. C. Milner, Karel Prikry:
  A partition relation for triples using a model of Todorcevic. 183-191
  
• Bojan Mohar:
  Some relations between analytic and geometric properties of infinite graphs. 193-219
  
• C. St. J. A. Nash-Williams:
  Reconstruction of infinite graphs. 221-229
  
• Frank Niedermeyer:
  f-Optimal factors of infinite graphs. 231-254
  
• Péter Komjáth, János Pach:
  Universal elements and the complexity of certain classes of infinite graphs. 255-270
  
• Norbert Polat, Gert Sabidussi:
  Asymmetrising sets in trees. 271-289
  
• Norbert Polat:
  Asymmetrization of infinite trees. 291-301
  
• Neil Robertson, Paul D. Seymour, Robin Thomas:
  Excluding infinite minors. 303-319
  
• Paul D. Seymour, Robin Thomas:
  An end-faithful spanning tree counterexample. 321-330
  
• Jozef Sirán:
  End-faithful forests and spanning trees in infinite graphs. 331-340
  
• Hans Jürgen Prömel, Wolfgang Thumser:
  Fast growing functions based on Ramsey theorems. 341-358
  
• Mark E. Watkins:
  Edge-transitive strips. 359-372
  
• Wolfgang Woess:
  Topological groups and infinite graphs. 373-384