Math 442, Schedule of lectures
Week 1 (6/1-10/1)
Proof techniques: Induction, constructive, contradiction
Examples
Week 2 (13/1-17/1)
Ch1: Definitions, isomorphic, subgraphs
Ch1: Adjacency
Ch1: Flavours, bipartite
Week 3 (20/1-24/1)
Ch2: Eulerian
Ch2: Fleury, Hamiltonian
Ch2: Ore, Dirac
Week 4 (27/1-31/1)
Ch1: Insanity
Ch4: Planar, Euler
Ch4: K_5, K_3,3
Week 5 (3/2-7/2)
Ch4: Kuratowski
Ch4: Glasgow
Ch5: Polyhedra
Week 6 (10/2-14/2)
MIDTERM
Ch5: Colouring
Week 7 (24/2-28/2)
Ch5: Brooks
Ch5: Chrom poly
Week 8 (2/3-6/3)
Ch5: 5-colour
Ch5: Face colouring
Week 9 (9/3-13/3)
Ch5: Edge colouring
Ch5: Timetabling
Ch3: Trees
Week 10 (16/3-20/3)
Ch3: Prufer/Cayley
Ch3: BFS/DFS
Week 11 (23/3-27/3)
Ch2: Shortest path/mazes
Ch2: Minimum spanning trees
Ch2: TSP
Week 12 (30/3-3/4)
Ch2: Digraphs
Ch2: Acyclic orientations
Ch6: Network flows
Ch6: Max-flow, min-cut - if time as only one lecture next week
Week 13 (6/4-8/4)
Ch2: Critical path analysis
Ch2: Longest path
Back
to course home page.