Sign inSign in

Eulerian circuit graph

A graph where every vertex has an even degree, allowing for a closed walk that visits every edge exactly once.
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.

Eulerian circuits1Graph vertex degree1

Lecturers

1

    Connections

    1

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

    Lecture1

    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.