1 paper
Aditya Bandekar, Péter Csikvári, Benjamin Mascuch +3
In this paper we study the following extremal graph theoretic problem: Given an undirected Eulerian graph G, which Eulerian orientation minimizes or maximizes the number of arbor…