MATH 274
Spring 2009
| Section:
01
|
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:
Logical Reasoning, Quantitative Reasoning
This course will focus on the creation of formally correct inductive and deductive arguments, and will train students to formulate mathematical theories and descriptions of specific and complex objects.
|
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture / Discussion | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: None |
|
Fulfills a Major Requirement for: (CADS)(COMP)(DATA-MN)(MATH) |
|
Past Enrollment Probability: Not Available |
|
|