Some conditions for the existence of Euler \(H\)-trails (Q2334082)

Let \(H\) be a graph (possibly with loops) and \(G\) be a multigraph without loops. \(G\) is said to be \(H\)-colored if there exists a function \(c: E(G) \rightarrow V(H)\). A trail \(W = (v_0, e_0, v_1, \dots, e_{k-1}, v_k)\) in \(G\) is an \(H\)-trail if and only if \((c(e_0), a_0, c(e_1), \dots, c(e_{k-2}), a_{k-2}, c(e_{k-1}))\) is a walk in \(H\), where \(a_i = c(e_i)c(e_{i+1})\in E(H)\) for every \(i\in \{0, \dots, k-2\}\). An \(H\)-trail \(W = (v_0, e_0, v_1, \dots, e_{k-1}, v_k)\) is a closed \(H\)-trail if \(v_0 = v_k\), and \(c(e_{k-1})\) and \(c(e_{0})\) are adjacent in \(H\); and a closed \(H\)-trail \(W\) is a closed Euler \(H\)-trail if \(E(W) = E(G)\). Notice that an \(H\)-trail is a properly colored trail in \(G\) when \(H\) is a complete graph without loops. In [Mat. Čas., Slovensk. Akad. Vied 18, 76--80 (1968; Zbl 0155.31901)], \textit{A. Kotzig} gave a characterization of edge-colored multigraphs which contain properly colored closed Euler trails. In this paper, the authors show conditions on an eulerian multigraph that guarantee the existence of closed Euler \(H\)-trails, where \(H\) is not necessarily a complete graph. Also, as a consequence of their main result, they obtain the Kotzig's result.