E. M. Forster, Howards End (1910)
TOPICS: Graph properties related to paths and cycles, especially trees, Eulerian and Hamiltonian graphs; networks, Max-Flow Min-Cut and related theorems; [Moore graphs]
TECHNIQUES: Algorithmic proofs; approximate solutions; [Eigenvalue techniques]
ALGORITHMS: Graph algorithms; greedy algorithm; stepwise improvement
We have met graphs several times before, in various guises. Now, ...