A transposition factorization of walk-permutations in graphs (Q804589)

Let \(w=e_ 1e_ 2...e_{n-1}e_ n\) be a walk in a graph G. A permutation \(\sigma \in S_ n\) is a w-permutation (walk permutation) if \(\sigma (w)=e_{\sigma (1)}e_{\sigma (2)}...e_{\sigma (n- 1)}e_{\sigma (n)}\) is also a walk in G. A permutation \(\sigma\) is a block transposition on \(e_ 1,e_ 2,...,e_{n-1},e_ n\) if \(e_ 1e_ 2...e_{\sigma (n-1)}e_ n\) can be factored as ABCDE with B,D\(\neq 1\) such that \(e_{\sigma (1)}e_{\sigma (2)}...e_{n-1}e_{\sigma (n)}\) can be factored as ADCBE. The main result is that any walk permutation can be expressed as a product of block transpositions.