Maximum directed cuts in digraphs with degree restriction

Jenö Lehel (1) , Frédéric Maffray (2) , Myriam Preissmann (2)

1 Department of Mathematical Sciences
2 G-SCOP_OC - Optimisation Combinatoire

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.

Domaines: Mathématique discrète [cs.DM]

Jenö Lehel, Frédéric Maffray, Myriam Preissmann. Maximum directed cuts in digraphs with degree restriction. Journal of Graph Theory, 2009, 61 (2), pp.140-156. ⟨hal-00189914⟩