MATH(CSCI) 4690/6690 -- Graph Theory -- Spring 2009
READING ASSIGNMENTS
Readings are from the text, except as indicated.
-
For January 13 : Chapter 1 through Section 1.7
-
For January 15 : Sections 1.8, 1.9, 2.1, and 2.2
-
For January 20 : Sections 2.3 through 2.5
-
For January 22 : Sections 2.6, 2.7, and 3.1
-
For January 27 : Sections 3.2, 3.3, and 3.5
-
For January 29 : Sections 4.1 and 4.2
-
For February 3 : Sections 4.3 and 4.4
-
For February 5 : Section 4.5 (text) and pp. 50--54 of Gibbons
Section 4.5 can be skimmed except that Example 4.29 (page 116) should
be understood.
The proof in class of the Matrix-Tree Theorem was from the book
Algorithmic Graph Theory
by Allan Gibbons, pp. 50--54 of which are available on
WebCT.
-
For February 10 : Section 4.7
The details of Section 4.6 were omitted.
-
For February 12 : Section 5.1
-
For February 17 : Sections 5.2 and 5.3
-
For February 19 : Sections 5.4 and 5.6
The details of Section 5.5 were omitted.
-
For February 24 : Sections 5.7 and 5.8
-
For February 26 : Section 6.1
-
For March 17 : Section 6.2
-
For March 19 : Section 6.3
-
For March 24 : Section 6.4
-
For March 31 : Section 6.5
-
For April 2 : Section 7.1
-
For April 7 : Sections 7.2 and 7.3
-
For April 9 : Section 7.4
-
For April 14 : Sections 7.5 and 7.6
In Section 7.5 the proof that condition 3 implies condition 2 for
Thm. 7.31 may be skimmed.
In Section 7.6 the material on abstract duals may be skimmed.
-
For April 16 : Section 7.7
-
For April 21 : Sections 7.8 and 7.9
-
For April 23 : Sections 8.1 and 8.2
-
For April 28 : Sections 8.3 and 8.4
In Section 8.3 the topics after the proof of Brooks' Theorem may be omitted.
In Section 8.4 the details after page 249 may be skimmed.