01:640:428 Graph Theory (3)
Colorability, connectedness, tournaments, eulerian and hamiltonian paths, orientability, and other topics from the theory of finite linear graphs, with an emphasis on applications chosen from social, biological, computer science, and physical problems.
Prerequisites: CALC3 and 01:640:250.
Returning Summer 2008 and Fall 2008
See archives. Text may vary. The course is usually based largely on Introduction to Graph Theory, 4th edition, by Robin J. Wilson, Prentice Hall, ISBN 0-582-24993-7.
Syllabus may vary. The Fall 2007 version is normal.
| Previous semesters: | ||
|---|---|---|
|
Fall 2007:
Prof. Ocone Summer 2007: Taught by Liviu Ilinca |
Fall 2006: Beck. Used a different text: Brualdi Fall 2005 (Schleimer) Fall 2004 (Maclagan) Fall 2003 (Zeilberger) |
Fall 1997 (Weibel) |
This material is posted by the faculty of the Mathematics Department at Rutgers New Brunswick for informational purposes. While we try to maintain it, information may not be current or may not apply to individual sections. The authority for content, textbook, syllabus, and grading policy lies with the current instructor.
Information posted prior to the beginning of the semester is frequently tentative, or based on previous semesters. Textbooks should not be purchased until confirmed with the instructor. For generally reliable textbook information—with the exception of sections with an alphabetic code like H1 or T1, and topics courses (197,395,495)—see the textbook lists for the appropriate terms: Fall orWinter, Summer.
Jan. 2008. Comments and questions to ugvc-AT-math.rutgers.edu