3 citations · 4 across the 8 of their papers we have counts for
1 paper · 1 filter
M. A. Babenko, A. V. Karzanov
A graph (digraph) G=(V,E) with a set T⊆V of terminals is called inner Eulerian if each nonterminal node v has even degree (resp. the numbers of edges entering and le…