1 paper
Amelia Cantwell, Juliann Geraci, Anant Godbole +1
A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also…