MATH 351AIntroduction 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.
A study of the basic concepts and problems of graph theory: connection, minimum path problems; bipartite graphs, the marriage problem; 1-factors of arbitrary graphs; planar graphs. 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 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
A study of the basic concepts and problems of graph theory: connection, minimum path problems; bipartite graphs, the marriage problem; 1-factors of arbitrary graphs; planar graphs.
2 hours lectures, one term
Prerequisites: No formal prerequisites. M239 recommended.
Not in the 1973–74 to 1974–75 calendars.
1972–73 1 calendar
Titled Introduction to Graph Theory.
Basic concepts; Konigsberg bridge problem, Euler trails and Hamiltonian cycles; marriage problem, maximum matchings, Hall’s theorem; planar graphs, four colour problem, chromatic number; Ramsey’s theorem. Stress will be on problem solving. Recommended for students interested in learning the basics of graph theory and for those intending to take higher level courses in graph theory. 2 hours lectures, one term. Prerequisites: No formal prerequisites, 239 recommended.
Faculty of Mathematics