MATH 351BIntroduction to Graph Theory and Combinatorics
- Faculty
- Mathematics
- Last listed
- 1975–76
No longer offered. It’s in Waterloo’s scanned calendars from 1972–73 to 1975–76; the 1995–96 to 2023–24 calendars are on ucalendar.
Hamiltonian circuits in a graph, four colour problem, other colouring problems; directed graphs, balanced orientations; an introduction to the theory of enumeration, with applications to counting graphs and other combinatorial objects. 2 hours lectures, one term
As printed in the 1975–76 calendar, read by OCR; the scanned page is the original.
Requirements, as last listed
Prerequisites: No formal prerequisites. M239 and M35la recommended
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1972–73 to 1975–76, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1975–76 1 calendar
Hamiltonian circuits in a graph, four colour problem, other colouring problems; directed graphs, balanced orientations; an introduction to the theory of enumeration, with applications to counting graphs and other combinatorial objects.
2 hours lectures, one term
Prerequisites: No formal prerequisites. M239 and M35la recommended
Not in the 1973–74 to 1974–75 calendars.
1972–73 1 calendar
Titled Applied Graph Theory.
Applications of graph theory to communication networks, timetabling, ranking, and other combinatorial problems. This course supplements the material covered in Math 352, but with greater emphasis on combinatorial aspects. 2 hours lectures, one term. Prerequisites: 35la.