Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have