Dec 04, 2024  
2023-2024 Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home

  Programs A-Z
  Programs by Type

  Academic Policies & Regulations
  Undergraduate Curriculum
  Course Descriptions

  Global Field Study
  Honors Program
  Interdisciplinary Programs & Courses
  Three-Year Degrees

  Accreditation
  Campus Map
  Disabilities Support Services
  Mission Statement
  Past Catalogs
  Student Handbook
  Academic Calendar
  Veteran’s Benefits
HELP
2023-2024 Undergraduate Catalog [ARCHIVED CATALOG]

MA 330 Graph Theory and Combinatorics

(4 Credits)
Graph theory topics include planar graphs, Euler and Hamiltonian circuits, graph coloring, trees, depth-first and breadth-first search, and 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.