Subeulerian Oriented Graphs
Subeulerian Oriented Graphs
A graph is subeulerian if it is a spanning subgraph of an eulerian graph. All subeulerian graphs were characterized by Boesch, Suffel, Tindell in 1977. Later, a simple proof of their theorem was given by Jaeger. A digraph $D$ is eulerian if and only if $D$ is connected and $d^{+}(x) …