MATH 458(a) Graph Theory — A ‘ 458 (b) Graph Theory — B
- Faculty
- Mathematics
- Last listed
- 1974–75
No longer offered. It’s in Waterloo’s scanned calendars from 1968–69 to 1974–75; the 1995–96 to 2023–24 calendars are on ucalendar.
Topics in graph theory. These may include symmetry in graphs, planarity, bipartite graphs, minimax theorems, directed graphs, enumeration, algorithms, colouring problems, matrices and graphs. Recommended for students who have taken a course in graph theory and wish to study additional topics not normally covered in an introductory course. 2 hours lectures, one term Prerequisite: M351 (a) or consent of instructor Continuation of topics covered in 458 (a). 2 hours lectures, one term Prerequisite: M458 (a)
As printed in the 1972–73 to 1974–75 calendars, read by OCR; the scanned page is the original.
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1968–69 to 1974–75, 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.
1972–73 to 1974–75 3 calendars
Topics in graph theory. These may include symmetry in graphs, planarity, bipartite graphs, minimax theorems, directed graphs, enumeration, algorithms, colouring problems, matrices and graphs. Recommended for students who have taken a course in graph theory and wish to study additional topics not normally covered in an introductory course. 2 hours lectures, one term Prerequisite: M351 (a) or consent of instructor
Continuation of topics covered in 458 (a). 2 hours lectures, one term Prerequisite: M458 (a)
1970–71 to 1971–72 2 calendars
A general survey of a number of topics in graph theory. Likely topics include: Eulerian and Hamiltonian lines in finite and infinite graphs, Menger’s Theorem, trees, directed graphs, enumerative results in graph theory, reconstruction of graphs from subgraphs, colouring of graphs, graphs and the Four Colour Problem, planarity and thickness of graphs, graphs and matroids, applications of matrices to graph theory. 2 hours lectures.
1968–69 to 1969–70 2 calendars
Titled Topological Graph Theory.
Selected topics within the general area of graphs and maps in the plane and on other surfaces, the four colour problem, connectivity and separation in graphs, thickness and genus of graphs, etc.
2 hours lectures.