Spanning a strong digraph by $\alpha$ circuits: A proof of Gallai's conjecture
Résumé
In 1963, Tibor Gallai~\cite{TG} asked whether every strongly connected directed graph $D$ is spanned by $\alpha$ directed circuits, where $\alpha$ is the stability of $D$. We give a proof of this conjecture.
Domaines
Mathématique discrète [cs.DM]
Loading...