← STEM / applied

Get started Book tutoring

In this program

Breadth-first and depth-first search
Shortest paths: Dijkstra's algorithm (introduction)
Matchings
Hall's marriage theorem (statement)
Vertex and edge colorings
Ramsey theory (introduction)

Graph algorithms and structures

Hall's marriage theorem (statement)

Graph theory & combinatorics · STEM / applied

Topic

Hall's marriage theorem (statement)

Practice by unit: Graph algorithms and structures

Undergraduate Graph Theory & Combinatorics — scope drawn from open graph theory texts and typical US combinatorics/graph theory syllabi.

Get started Book tutoring All topics