Includes bibliographical references.

Polynomials ; Tutte invariants for olymatroids ; Extremal matroid theory ; Subexponentially computable truncations of Jonestype polynomials ; Knots and braids: some algorithmic questions ; A survey of linkless embeddings ; Colin de Verdiere On a new graph invariant and a criterion for planarity (This article is not available due to permission restrictions.) ; Four problems on plane graphs raised by Branko Grunbaum ; Counterexamples to a conjecture of Las Vergnas and Meyniel ; An extremal function for the achromatic number ; The asymptotic structure of ree graphs ; Induced minors and related problems ; Induced circuits in graphs on surfaces ; Treerepresentation of directed circuits ; Intercyclic digraphs ; Eulerian trails through a set of terminals in specific, unique and all orders ; educible cycles containing two specified edges in 2k+1) dgeconnected graphs ; Edgedisjoint cycles in dgeconnected graphs ; Finding disjoint trees in planar graphs in linear time ; Surface triangulations without short noncontractible cycles ; Representativity and flexibility on the projective plane ; On nonnull separating circuits in embedded graphs ; Projectiveplanar graphs with even duals. II ; actors, connectivity and graph minors ; A conjecture in topological graph theory ; On the closed ell embedding conjecture ; Cycle cover theorems and their applications ; Cones, lattices and Hilbert bases of circuits and perfect matchings ; Regular maps from voltage assignments ; The infinite grid covers the infinite halfgrid ; Dominating functions and topological graph minors ; Notes on rays and automorphisms of locally finite graphs ; Quasiordinals and proof theory ; Minor classes: extended abstract ; Wellquasiordering finite posets (extended abstract) ; The immersion relation on webs ; Structural descriptions of lower ideals of trees ; Finite automata, bounded treewidth and wellquasiordering ; Graph grammars, monadic secondorder logic and the theory of graph minors ; Graph reductions, and techniques for finding minimal forbidden minors ; An upper bound on the size of an obstruction ; An obstructionbased approach to layout optimization ; Decomposing onnected graphs ; Graph planarity and related topics ; Excluding a graph with one crossing ; Open Problems W T Tutte ; James Oxley and Geoff Whittle ; Joseph P S Kung ; Teresa M Przytycka and Jozef H Przytycki ; D J A Welsh ; Neil Robertson P D Seymour and Robin Thomas ; Oleg Borodin ; Bruce Reed ; Bela Bollobas Bruce Reed and Andrew Thomason ; H J Promel and A Steger ; Michael Fellows Jan Kratochvil Matthias Middendorf and Frank Pfeiffer ; Alexander Schrijver ; Andras Frank and Tibor Jordan ; William McCuaig ; Jrgen BangJensen and Svatopluk Poljak ; Haruko Okamura ; Andreas Huck ; B A Reed N Robertson A Schrijver and P D Seymour ; Teresa M Przytycka and Jozef H Przytycki ; R P Vitray ; Xiao Ya Zha and Yue Zhao ; Seiya Negami ; Nathaniel Dean and Katsuhiro Ota ; John Philip Huneke ; Xiao Ya Zha ; CunQuan Zhang ; Luis A Goddyn ; Pavol Gvozdjak and Jozef Siran ; Bogdan Oporowski ; Reinhard Diestel ; H A Jung ; L Gordeev ; Dirk Vertigan ; Jens Gustedt ; Guoli Ding ; Neil Robertson P D Seymour and Robin Thomas ; Karl Abrahamson and Michael Fellows ; Bruno Courcelle ; Andrzej Proskurowski ; Jens Lagergren ; Michael A Langston ; Collette R Coullard and Donald K Wagner ; A K Kelmans ; Neil Robertson and Paul Seymour ; Nathaniel Dean