Flashcards
Euler's formula, planar edge bounds, chromatic numbers, Hall's theorem, BFS, DFS, Dijkstra and topological sorting.
Planar graph: definition
Tap to flip
A graph that can be drawn in the plane with no edges crossing (edges meet only at vertices). A particular drawing is a plane graph; the regions it bounds, including the unbounded outer one, are faces.
Tap to see the front