This is a preview. Log in through your library . Abstract A non-backtracking walk on a graph, H, is a directed path of directed edges of H such that no edge is the inverse of its preceding edge.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback