Nov 22, 2024  
2015-2016 Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home
  Academic Policies and Regulations
  Financial Aid Policies
  Undergraduate Curriculum
  Honors Program
  Three-Year Degrees
  University Seminars
  English Language Institute
  Global Field Study Programs
  Programs A-Z
  Programs by Area
  Programs by Type
  Course Descriptions
HELP
2015-2016 Undergraduate Catalog [ARCHIVED CATALOG]

MA 330 Graph Theory and Combinatorics

Graph theory topics include planar graphs, Euler and Hamiltonian circuits, graph coloring, trees, depth-first and breadth-first search, network algorithms. Combinatorial topics include arrangements and selections, generating functions, recurrence relations, pigeon-hole principle, and inclusion-exclusion. This course covers applications to computer science and business and also material of interest to mathematics/ secondary education majors. MA 330 may be used to satisfy the Computer Science MA 230  requirement.

Prerequisite: MA 203  and MA 225  or permission of the instructor.