Quo vadis, graph theory? A source book for challenges and directions (Q684911)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Tutte, William T.}, Whither graph theory?, 1-3 [Zbl 0788.05085] \textit{Bollobás, Bela}, The future of graph theory, 5-11 [Zbl 0788.05084] \textit{Roberts, Fred S.}, New directions in graph theory (with an emphasis on the role of applications), 13-43 [Zbl 0787.05089] \textit{Frick, Marietjie}, A survey of \((m,k)\)-colorings, 45-57 [Zbl 0787.05037] \textit{Gavril, Fanica; Krasikov, Ilia; Schönheim, Johanan}, Numerical decks of trees, 59-69 [Zbl 0788.05023] \textit{Bauslaugh, Bruce}, The complexity of colouring by infinite vertex transitive graphs, 71-79 [Zbl 0791.05035] \textit{Erdős, Paul; Tuza, Zsolt}, Rainbow subgraphs in edge-colorings of complete graphs, 81-88 [Zbl 0791.05037] \textit{Lewinter, Martin}, Graph with special distance properties, 89-92 [Zbl 0787.05034] \textit{Godehardt, Erhard A. J.}, Probability models for random multigraphs with applications in cluster analysis, 93-108 [Zbl 0790.05075] \textit{Balaban, Alexandru T.}, Solved and unsolved problems in chemical graph theory, 109-126 [Zbl 0786.05083] \textit{Chartrand, Gary; Johns, Garry L.; Tian, Songlin}, Detour distance in graphs, 127-136 [Zbl 0789.05034] \textit{Grimaldi, Ralph P.}, Integer-distance graphs, 137-144 [Zbl 0788.05038] \textit{Bauer, Douglas; Schmeichel, Edward}, Toughness and the cycle structure of graphs, 145-151 [Zbl 0805.05046] \textit{Tutte, William T.}, The Birkhoff-Lewis equations for graph-colorings, 153-158 [Zbl 0787.05042] \textit{Welsh, Dominic J. A.}, The complexity of knots, 159-171 [Zbl 0801.68086] \textit{Farrell, Edward J.}, The impact of \(F\)-polynomials in graph theory, 173-178 [Zbl 0786.05064] \textit{Chvátal, Václav; Slater, Peter J.}, A note on well-covered graphs, 179-181 [Zbl 0801.68119] \textit{Zhang, Cun-Quan}, Cycle covers and cycle decompositions of graphs, 183-189 [Zbl 0804.05055] \textit{Liu, Jiping; Yu, Qinglin}, Matching extensions and products of graphs, 191-200 [Zbl 0799.05050] \textit{Read, Ronald C.}, Prospects for graph theory algorithms, 201-210 [Zbl 0801.68118] \textit{Steinberg, Richard}, The state of the three color problem, 211-248 [Zbl 0791.05044] \textit{Karabeg, Almira}, Ranking planar embeddings using PQ-trees, 249-260 [Zbl 0792.05045] \textit{Erdős, Paul; Gimbel, John}, Some problems and results in cochromatic theory, 261-264 [Zbl 0791.05038] \textit{Ruciński, Andrzej}, From random graphs to graph theory, 265-273 [Zbl 0790.05080] \textit{Plummer, Michael D.}, Matching and vertex packing: How ``hard'' are they?, 275-312 [Zbl 0801.68066] \textit{Kim, Suh-Ryung}, The competition number and its variants, 313-326 [Zbl 0789.05041] \textit{Lewinter, Martin; Widulski, William F.}, Which double starlike trees span ladders?, 327-331 [Zbl 0789.05029] \textit{Balińska, Krystyna T.; Quintas, Louis V.}, The random \(f\)-graph process, 333-339 [Zbl 0786.05075] \textit{Palmer, Edgar M.}, Quo vadis, random graph theory?, 341-348 [Zbl 0788.05080] \textit{Frank, Ove; Nowicki, Krysztof}, Exploratory statistical analysis of networks, 349-365 [Zbl 0787.62065] \textit{Liu, Jiping}, The Hamiltonian decomposition of certain circulant graphs, 367-373 [Zbl 0804.05056]