Maximum directed cuts in digraphs with degree restriction
Jenő Lehel, Frédéric Maffray, Myriam Preissmann · Journal of Graph Theory · 2009
Abstract For integers m, k ≥1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k . © 2009 Wiley Periodicals, Inc. J Graph Theory