| 191 | -- | 212 | Fred Glover, David Karney, Darwin Klingman. Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems |
| 213 | -- | 239 | Howard Frank, W. Chou. Network properties of the ARPA computer network |
| 241 | -- | 253 | J. Halpern, I. Priess. Shortest path with time constraints on movement and parking |
| 255 | -- | 265 | Edward Minieka. Dynamic network flows with arc changes |
| 267 | -- | 280 | E. Kant. A multicommodity flow problem |
| 281 | -- | 282 | D. P. Geller, Anthony J. W. Hilton. How to colour the lines of a bigraph |
| 283 | -- | 285 | M. R. Wohlers. Network analysis and synthesis. by B. D. O. Anderson and S. Vongpanitlerd Prentice-Hall, Inc., Englewood Cliffs, N. J. 1973, 548 pages, $17.95 |