A Minimax Arc Theorem for Reducible Flow Graphs
Vijaya Ramachandran · SIAM Journal on Discrete Mathematics · 1990
A conjecture of Frank and Gyarfas is established by proving that the cardinality of a minimum feedback arc set in a reducible flow graph is equal to the cardinality of a maximum collection of arc disjoint cycles.