Paired 2-disjoint path covers of the 3-dimensional burnt pancake graph

An exhaustive list of 2-disjoint path covers (2-DPC's) of the 3-dimensional burnt pancake graph 𝐵𝑃₃ between all possible terminal sets of size two. Since 𝐵𝑃₃ is a vertex transitive graph, the first terminal vertex can be fixed to (123). By a computer search we were able to find 2-DPC's of 𝐵𝑃₃ for all different distributions of the remaining three terminals such that all four terminals are pairwise distinct. The list of the resulting paths is available in the file attached below.