A graph is a set V of elements called vertices and a set E of pairs of elements of V called edges. From this simple definition many elegant models have been developed. This course will be a survey course of topics in graph theory with an emphasis on the role of planar graphs. Graph connectivity, vertex and edge coloring, graph embedding, and descriptions of snarks (2-edge-connected 3-regular graphs which are not 3 colorable) will be covered.
||Gen Ed Area Dept:
|Course Format: Lecture/Discussion||Grading Mode: Graded|
||Fulfills a Major Requirement for: (CADS)(COMP)(DATA-MN)(MATH)
||Past Enrollment Probability: Not Available
|Major Readings: Wesleyan RJ Julia Bookstore
|Examinations and Assignments: |
Regular homework, class presentation, midterm, final.
|Additional Requirements and/or Comments: |
Students should have already taken a 200-level math course.
|Instructor(s): Collins,Karen L. Times: ..T.R.. 01:10PM-02:30PM; Location: SCIE638; |
|Total Enrollment Limit: 25||SR major: 8||JR major: 7|| || |
|Seats Available: 4||GRAD: 0||SR non-major: 0||JR non-major: 0||SO: 7||FR: 3|
|Drop/Add Enrollment Requests|
|Total Submitted Requests: 1||1st Ranked: 0||2nd Ranked: 0||3rd Ranked: 0||4th Ranked: 0||Unranked: 1|