Whither graph theory?, W.T. Tutte; the future of graph theory, B. Bollobas; new directions in graph theory (with an emphasis on the role of applications), F.S. Roberts; a survey of (m,k)-colorings, M. Frick; numerical decks of trees, F. Gavril et al; the complexity of colouring by infinite vertex transitive graphs, B. Bauslaugh; rainbow subgraphs in edge-colourings of complete graphs, P. Erdos and Z. Tuza; graphs with special distance properties, M. Lewinter; probability models for random multigraphs with applications in cluster analysis, E.A.J. Godehardt; solved and unsolved problems in chemical graph theory, A.T. Balaban; detour distance in graphs, G. Chartrand et al; integer-distance graphs, R.P. Grimaldi; toughness and the cycle structure of graphs, D. Bauer and E, Schmeichel; the Birkhoff-Lewis equations for graph-colourings, W.T. Tutte; the complexity of knots, D.J.A. Welsh; the impact of F-polynomials in graph theory, E.J. Farrell; a note on well-covered graphs, V. Chvatal and P.J. Slater; cycle covers and cycle decomposition of graphs, C.-Q. Zhang; matching extensions and productos of graphs, J. Liu and Q. Yu; prospects for graph theory algorithms, R.C. Read; the state of the three colour problem, R. Steinberg; ranking planar embeddings using PQ-trees, A. Karabeg; some problems and results in cochromatic theory, P. Erdos and J. Gimbel; from random graphs to graph theory, A. Rucinski; matching and vertex packing - how "hard" are they?, M.D. Plummer; the competition number and its variants, S.-R. Kim; which double starlike trees span ladders?, M. Lewinter and W.F. Widulski; the random f-graph process, K.T. Balinska and L.V. Quintas; quo vadis, random graph theory?, E.M. Palmer; exploratory statistical analysis of networks, O. Frank and K. Norwicki; the Hamiltonian decomposition of certain circulant graphs, J. Liu; discovery-method teaching in graph theory, P.Z. Chinn.
