main
home
general information
contact/directions
research
academics

degree programs courses course evaluations survival guide courses areas of focus program requirements examination requirements handbook academic integrity people
student corner
news & events
news & events
site map
visitors
prospective students
prospective faculty
search




Department of Computer Science

home > academics > graduate > courses

CSCI 223 - Graph Theory and Applications

Choi 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
student corner | news & events | site map | prospective students | prospective faculty


The George Washington University © 2003, The George Washington University
Department of Computer Science
Last Updated: December 19, 2000