My PlannerExplore and compare past grades, professor ratings, and reviews to find the perfect class.
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Grades:
Median GPA:
Mean GPA:
5.0
Professor rating
5.0
Difficulty
1,000
Ratings given
99%
Would take again
Visit Rate My Professors
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
MATH 6312 Viswanath Ramakrishna | |||||
A | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
MATH 6312 Viswanath Ramakrishna | |||||
A | |||||
Grades: 1,249
Median GPA: A
Mean GPA: 3.380
4
Professor rating
3.2
Difficulty
60
Ratings given
76%
Would take again
Combinatorics and Graph Theory
MATH 6312
School of Natural Sciences and Mathematics
This course covers theory and applications of combinatorics and graphs, topics from basic counting principles, principle of inclusion and exclusion, permutation statistics, ordinary and exponential generating functions, composition of integers, integer partitions, Stirling numbers of the first kind, q-analogs of binomial and multinomial coefficients, Euler's formula, Hamilton paths, planar graphs, chromatic and Tutte polynomials and algorithms on networks. 3 credit hours.
Prerequisites: Theoretical Concepts of Calculus and Abstract Algebra I is required or instructor consent required.
Offering Frequency: Every two years
Grades: 395
Median GPA: A
Mean GPA: 3.735
Click a checkbox to add something to compare.
Grades: 1,249
Median GPA: A
Mean GPA: 3.380
4
Professor rating
3.2
Difficulty
60
Ratings given
76%
Would take again
Combinatorics and Graph Theory
MATH 6312
School of Natural Sciences and Mathematics
This course covers theory and applications of combinatorics and graphs, topics from basic counting principles, principle of inclusion and exclusion, permutation statistics, ordinary and exponential generating functions, composition of integers, integer partitions, Stirling numbers of the first kind, q-analogs of binomial and multinomial coefficients, Euler's formula, Hamilton paths, planar graphs, chromatic and Tutte polynomials and algorithms on networks. 3 credit hours.
Prerequisites: Theoretical Concepts of Calculus and Abstract Algebra I is required or instructor consent required.
Offering Frequency: Every two years
Grades: 395
Median GPA: A
Mean GPA: 3.735
Click a checkbox to add something to compare.