Graph Theory
Spring 2016
- Instructor: Julian Dymacek
- Time: MWF 11:00-11:50am (Syllabus)
- Location: Ruffner 356 (Lecture)
- Office Hours: M:9-10am, T:12:30-1:30pm, W:9-10am, 3-4pm
Class Schedule
- 01/20 – Introduction
- 01/22 – Snow Day!
-
- 01/25 – Snow Day!
- 01/27 – Definitions
- 01/29 – Isomorphism, Complement, Complete
-
- 02/01 – Adjacency Matrix, Walks...
- 02/03 – Adjacency Matrix Thm.
- 02/05 – Adjacency Matrix Thm., Connected, and Trees
(notes)
-
- 02/08 – Tree Traversals
- 02/10 – DFS \& BFS Algorithms
- 02/12 – DFS \& BFS Applications
-
- 02/15 – Snow Day!
- 02/17 – Minimum Spanning Trees
- 02/19 – Shortest Path
-
- 02/22 – Shortest Path
- 02/24 –
- 02/26 – Real live graph theorist -- Dr. Wayne Dymacek
-
- 02/22 – Eulerian Graphs
- 02/24 – Euler's Thm.
- 03/04 – Hamiltonian Graphs
-
- 03/14 – Project work day
- 03/16 – Ore's Thm.
- 03/18 – Graph closure, Polynomial verifiable
-
- 03/14 – NP-Complete
- 03/16 – Hamiltonian is NP-Complete
- 03/18 – Hamiltonian is NP-Complete
-
- 03/28 – Hamiltonian is NP-Complete
- 03/30 – TSP \& Planarity
- 04/01 – Euler's Formula
-
- 03/04 – Planarity
- 03/06 – Planarity
- 04/08 – Planarity
-
- 03/11 – Planarity \& Steinhaus Graphs
- 03/13 – Steinhaus Graphs
- 04/15 – Clique
Quizzes
- 02/01 – Quiz 1
- 02/10 – Quiz 2
- 02/22 – Quiz 3
- 03/04 – Quiz 4