O'Reilly logo

Combinatorics by Peter J. Cameron

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

11.  Graphs

Only connect!

E. M. Forster, Howards End (1910)

image

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

CROSS-REFERENCES: Trees (Chapter 4); Hall’s Marriage Theorem (Chapter 6); [de Bruijn–Erdimages theorem (Chapter 7)]

We have met graphs several times before, in various guises. Now, ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required