MTH 466 - Graph Theory And Combinatorics

Institution:

University of Dayton

Subject:

Mathematics

Description:

Graphs as algebraic structures; eulerian, hamiltonian, complete, connected and planar graphs. Applications include scheduling and routing problems. Discussion of algorithms for optimal or near-optimal solutions. Combinatorial topics could include generating functions, recurrence relations, Polya's theorem and Ramsey Theory. Prerequisite(s): MTH 310.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.udayton.edu

Phone Number:

(937) 229-1000

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.