Math 428 - Graph Theory
|
 |
General Information (Catalog listing)
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.
Textbook
G. Chartrand, L. Lesniak, P. Zhang;; Graphs and Digraphs
(fifth edition)
CRC Press, 2011; (ISBN-13 978-1-4398-2627-0)
Syllabus
Syllabus may vary. The Fall 2010 version is typical.
Spring 2012 Schedule
Taught in the Summer and Fall semesters.
| Previous semesters: | ||
|---|---|---|
|
|
|
Disclaimer: Posted for informational purposes only
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 list.