1 paper
Jens Harlander, Maizie Quatrone
An Euler circuit of a graph is a closed path that visits every edge of the graph exactly once. Euler circuit and circuit decomposition problems can also be formulated for higher di…