279 c. 1962 г.
Fundamental concepts
Connectedness
Path problems
Trees
Leaves and lobes
The axiom of choice
Matching theorems
Directed graphs
Acyclic graphs
Partial order
Binary relations and Galois correspondences
Connecting paths
Dominating sets, covering sets, and independent sets
Chromatic graphs
Groups and graphs