Login to filter by course Login to filter by course Reset
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Explores a variety of open problems in graph theory and computational complexity, challenging students to analyze and solve complex issues.
Explores fundamental graph theory concepts, Erdős' results, Chromatic Lemma, and Union Bound theorem in graph theory.
Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.
