MATH 137A - Graph and Network Theory

Elements of graph and network theory including paths, circuits, trees, coloring, planarity, matching theory, Hall's theorem, applications to scheduling theory, flows in networks, Menger's theorem, and other topics as time permits.

Prerequisites: Math 4A and 8, each with a minimum grade of C.

MATH 137A

60 / 60 Full

Graph and Network Theory

Karel Casteels 4.3

M W F

11:00 AM - 11:50 AM

40.2% A