ConceptMathematics
Non-backtracking walk
A walk on a graph in which no edge is immediately followed by its reverse edge.
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.
Lecturers
4Each in their own terms, from the easiest level.
Yizhe Zhu
A walk on a hypergraph that moves from a vertex to a hyperedge and then to a different vertex in that hyperedge, without immediately returning to the previous hyperedge.Sebastian Cioaba
A walk in a graph where no edge is immediately traversed back to the vertex it just came from.Tobias Weich
A walk on a graph that does not allow immediate reversals of edges.
Connections
7The lectures that define it or assume it, and the concepts next to it.