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