Coxeter graph Petersen graph Heawood graph Truncated octahedron

 
Date Topic Read Links
2012-09-10 Graphs [BM] §1.1; [W] §1.1 email
2012-09-12 Isomorphisms [BM] §1.2; [W] §1.1
2012-09-13 Sources of graphs [BM] §1.3; [W] §1.1 problem set #1
2012-09-17 Subgraphs [BM] §2.2; [W] §1.2
2012-09-19 Walks [BM] §3.2; [W] §1.2
2012-09-20 Eulerian tours [BM] §3.3; [W] §1.2 problem set #2
2012-09-24 Trees [BM] §4.1; [W] §2.1
2012-09-26 Project overview; cut edges [BM] §2.5; [W] §1.2
2012-09-27 Enumeration of trees [BM] §4.2; [W] §2.2 problem set #3
2012-10-01 Minimum spanning trees [BM] §6.2; [W] §2.3
2012-10-03 Cut vertices [BM] §5.1; [W] §4.1
2012-10-04 Blocks [BM] §5.2; [W] §4.1 problem set #4
2012-10-08 Thanksgiving
2012-10-10 Ear decompositions [BM] §5.3; [W] §4.2 outline
2012-10-11 Menger's theorem [BM] §9.1; [W] §4.2 problem set #5
2012-10-15 Fan lemma [BM] §9.2; [W] §4.2
2012-10-17 Chordal graphs [BM] §9.7; [W] §5.3
2012-10-18 Maximum matchings [BM] §16.1; [W] §3.1 problem set #6
2012-10-22 Hall's theorem [BM] §16.2; [W] §3.1
2012-10-24 Gallai Identities [BM] §12.1; [W] §3.1
2012-10-25 Turán's theorem [BM] §12.2; [W] §5.2 problem set #7
2012-10-29 Tutte's theorem [BM] §16.3; [W] §3.3
2012-10-31 Matching in arbitrary graphs [BM] §16.4; [W] §3.3
2012-11-01 Chromatic number [BM] §14.1; [W] §5.1 problem set #8
2012-11-05 Girth and chromatic number [BM] §14.3; [W] §5.2
2012-11-07 Critical graphs [BM] §14.2; [W] §5.2 rough draft
2012-11-08 Perfect graphs [BM] §14.4; [W] §8.1 problem set #9
2012-11-12 Chromatic polynomials [BM] §14.7; [W] §5.3
2012-11-14 Jordan curve theorem [BM] §10.1; [W] §6.2 feedback
2012-11-15 Planar graphs [BM] §10.2; [W] §6.1 problem set #10
2012-11-19 Euler's formula [BM] §10.3; [W] §6.1
2012-11-21 Bridges [BM] §10.4; [W] §6.2
2012-11-22 3-connected graphs [BM] §10.4; [W] §6.2 problem set #11
2012-11-26 Kuratowski's theorem [BM] §10.5; [W] §6.2
2012-11-28 Five-colour theorem [BM] §11.2; [W] §6.3 project
2012-11-29 Review problem set #12
2012-12-13 Exam (09:00 — 12:00) BEWS Gym enter PEC