Reading and other assignments will be listed here in
chronological order,
i.e., with the most recent ones at the bottom of the list.
Homework assignments must be neatly written or typed. All answers
should be complete sentences unless the answer is just a number.
Homework is due by noon on the due date. If late homework becomes a
problem, I will announce a late policy in class and on this web site.
This document was last modified on
February 22, 2005.
Reading from Intro to Graph Theory: Chapter 1 (Sections 1-4)
Homework Assignment #1: Chapter 1,
problems 1.8 (for (a) only do one set, for (b) H must have at least
3 vertices), 1.15, 1.16, 1.22, 1.32 (omit c, d extra credit).
(due Thursday of Second Week)