The Canvas class for Dartmouth's Spring 2020 course in Graph Theory, Math 38, seems to be mostly open. According to the syllabus, the course uses the 2nd edition of West's Introduction to Graph Theory.
This course will cover the fundamental concepts of graph theory: simple graphs, digraphs, Eulerian and Hamiltonian graphs, trees, matchings, networks, paths and cycles, graph colorings, and planar graphs. Famous problems in graph theory include: the Minimum Connector Problem (building roads at minimum cost), the Marriage Problem (matching men and women into compatible pairs), the Assignment Problem (filling jobs with applicants), the Network Flow Problem (maximizing flow in a network), the Committee Scheduling Problem (using the fewest time slots), the Four Color Problem (coloring maps with four colors so that adjacent regions have different colors), and the Traveling Salesman Problem (visiting a list of cities minimizing the traveled distance).
If you navigate to the Pages, you'll see Week 1, Week 2, etc. Behind each of those links is a wrap-up of the week's lectures.
The course ran for 10 weeks, 3 sessions per week. Each week seemed to have 8-12 prerecorded video lectures, most hosted on the Dartmouth Mathematics Department server, but a handful linked from YouTube. In addition, there was a live Zoom session that was recorded. The Zoom recordings appear to be inaccessible without a login, but notes taken during the live sessions are available. Also, each session has a PDF of the professor's lecture notes. Finally, if you want to work the weekly problem sets, those are available, too, but the solutions have been removed.
- About 100 prerecorded video lectures (10-15 minutes each)
- About 8 problem sets
- About 20 live Zoom notes
- Recordings of live Zoom sessions
- Solutions to problem sets
- Quizzes, midterm, and final exam