Sign inSign in
ConceptMathematics

Graph coloring

Coloring the nodes of a graph such that no two adjacent nodes share the same color.
as Timothy Gowers defines itClay Mathematics Institute
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Graph theory1Vertices and edges1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Lectures that assume it

    15

    The first 12 are shown.

    Connections

    21

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.