Notes

• West Section 1.1 introduction
• West Section 1.2 paths, trail, Eulers theorem
• West Section 1.3 degree sum sequences and Havel-Hakimi
• West Section 1.4 directed graphs
• West Section 2.1 trees and distance
• West Chapter 2.2 spanning trees enumeration.pdf
• West Chapter 2.3 kruskal dijkstra and huffman encoding.pdf
• West Chapter 3.1 matchings and covers.pdf
• West Chapter 3.2 hungarian algorithm and gale shapley
• West Chapter 4.1 cuts and connectivity
• West Chapter 4.2 connectivity menger dirac
• West Chapter 4.3 max flow min cut and menger
• West Chapter 5.1 coloring

• West Chapter 5.2 k chromatic graphs

• Euler characteristic worksheet (due to Joel David Hamkins) here
• Degree Sequences exercise here