|
home > academics > graduate > courses CSCI 223 - Graph Theory and ApplicationsChoi and Staff Credits: 3
Undirected and directed graphs. Connectivity, partitions, cycles and matchings.
Edge and vertex coloring, chromatic polynomials, and the four-coloring problem.
Planar graphs and Kuratowski's theorem. Properties of random graphs. Applications
to a variety of problems.
Prerequisite: CSCI 212. (Spring, even years)
|
||
|
home |
general information |
contact/directions |
research |
academics |
people |
||
|
|