Spanning Eulerian subgraphs in generalized prisms. (Q2846647)

Given a graph \(G\) on \(n\) vertices and a permutation \(\alpha \) in the symmetric group on \(V(G)\), the \(\alpha \)-generalized prism \(\alpha (G)\) consists of two copies of \(G\) along with edges between the two copies determined by the permutation \(\alpha \). A graph \(G\) is supereulerian if it has a spanning subgraph that is Eulerian. Various conditions are given that imply a generalized prism is supereulerian. For example it is shown that if \(G\) with at most one cut edge such that the addition of at most two edges in \(G\) implies the existence of two disjoint spanning trees, then for any permutation \(\alpha \) of \(V(G)\) the generalized prism \(\alpha (G)\) is supereulerian. Other conditions implying a generalized prism is supereulerian are proved.