MATH 201
Spring 2008 not offered
|
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 that are not 3 colorable) will be covered. |
|
Essential Capabilities:
None |
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture / Discussion | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: None |
|
Fulfills a Requirement for: (CADS)(COMP)(DATA-MN)(MATH) |
|
|