Middlebury

MATH 0247

Graph Theory

Graph Theory
A graph (or network) is a useful mathematical model when studying a set of discrete objects and the relationships among them. We often represent an object with a vertex (node) and a relation between a pair with an edge (line). With the graph in hand, we then ask questions, such as: Is it connected? Can one traverse each edge precisely once and return to a starting vertex? For a fixed k/, is it possible to “color” the vertices using /k colors so that no two vertices that share an edge receive the same color? More formally, we study the following topics: trees, distance, degree sequences, matchings, connectivity, coloring, and planarity. Proof writing is emphasized. (MATH 0200 or by waiver) 3 hrs. lect./disc.
Subject:
Mathematics
Department:
Mathematics & Statistics
Division:
Natural Sciences
Requirements Fulfilled:
DED
Equivalent Courses:

Sections

Fall 2024

MATH0247A-F24 Lecture (Schmitt)

Spring 2023

MATH0247A-S23 Lecture (Schmitt)

Spring 2021

MATH0247A-S21 Lecture (Schmitt)

Fall 2019

MATH0247A-F19 Lecture (Schmitt)

Fall 2017

MATH0247A-F17 Lecture (Schmitt)

Spring 2014

MATH0247A-S14 Lecture (Schmitt)

Fall 2011

MATH0247A-F11 Lecture (Schmitt)

Spring 2010

MATH0247A-S10 Lecture (Swenton)

Spring 2008

MATH0247A-S08 Lecture (Schmitt)

Spring 2007

MATH0247A-S07 Lecture

Spring 2006

MATH0247A-S06 Lecture (Schmitt)

Spring 2004

MATH0247A-S04 Lecture (Peterson)