(Some of) the many uses of Eulerian graphs in graph theory (plus some applications) (Q5931407)

This is an excellent survey of recent results about Eulerian graphs and applications. From this survey, we can see connections between Eulerian graphs and Hamiltonian cycles, nowhere-zero flows, independent sets, colorings, cycle-coverings, etc., and the power of Eulerian graphs in solving open problems, such as the cycle-plus-triangle problem (Du-Hsu-Hwang conjecture and Erdős conjecture). In each part, some open problems and unsolved conjecture are presented.