MATH 427Graph Theory
- Faculty
- Mathematics
- Last listed
- 1969–70
No longer offered. It’s in Waterloo’s scanned calendars from 1965–66 to 1969–70; the 1995–96 to 2023–24 calendars are on ucalendar.
Graphs and subgraphs. Connection modulo a subgraph. Trees, atcs, and polygons. Separation. 3-connection. The structure of 2-connected graphs. Planar graphs, Kuratowski’s theorem. 2 hours lectures.
As printed in the 1968–69 to 1969–70 calendars, read by OCR; the scanned page is the original.
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1965–66 to 1969–70, 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.
1968–69 to 1969–70 2 calendars
Graphs and subgraphs. Connection modulo a subgraph. Trees, atcs, and polygons. Separation. 3-connection. The structure of 2-connected graphs. Planar graphs, Kuratowski’s theorem.
2 hours lectures.
1965–66 to 1967–68 3 calendars
Introduction to basic concepts and theorems, connectivity, planarity, arboricity, directed graphs, partial orderings, girth and regularity, the four-colour problem.