16 citations · 97 across the 26 of their papers we have counts for
1 paper · 1 filter
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeeo
A digraph is eulerian if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltoni…