Lecture Notes

Lecture notes for this semester are available for
  1. Basic Definitions and Graph Families (§§ 1.1 - 1.2)
  2. Subgraphs and Graph Operations (§§ 2.1 - 2.2)
  3. Graph Isomorphism and Matrix Representations (§§ 2.3 - 2.5)
  4. Trees (§§ 3.1 - 3.3)
  5. Counting, Traversing and Searching Binary Trees (§§ 3.4 - 3.6)
  6. Depth-First and Breadth-First Search (§§ 4.1 - 4.3)
  7. Spanning Trees (§§ 4.4 - 4.5)
  8. Connectivity (§§ 5.1 - 5.3)
  9. Optimal Graph Traversals (§§ 6.1 - 6.4)
  10. Graph Colorings (§§ 10.1 - 10.2)
  11. Network Flows and Applications (§§ 12.1 - 12.4)

The following set of lecture notes are those for an earlier version of this course. They follow the text, Applied Combinatorics by Fred Roberts. They are included here as supplementary material.


<em>Back to<a href="m4408.html"> index</a></em> (non-frame version) <hr>