ConceptTheory & Algos
Eulerian circuit graph
A graph where every vertex has an even degree, allowing for a closed walk that visits every edge exactly once.
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
1Connections
1The lectures that define it or assume it, and the concepts next to it.