Covering and Euler cycles on non-oriented graphs (Q1714975)

A cycle is called an edge covering cycle if every edge of the graph G is present at least once in the cycle. The authors prove a formula for counting the number of equivalence classes of nonperiodic covering cycles in the graph. A special case gives the number of Euler cycles in the non-oriented graph. A determinantal identity is established in which the number of Euler cycles can be computed from one of the coefficients in a formal Taylor expansion form of the identity.