Spanning a strong digraph by α circuits: A proof of Gallai’s conjecture

Authors:
Stéphane Bessy;Stéphan Thomassé
Affiliations:
Université Montpellier 2, LIRMM, 161 rue Ada, 34392, Montpellier Cedex 5, France;Université Montpellier 2, LIRMM, 161 rue Ada, 34392, Montpellier Cedex 5, France
Venue:
Combinatorica
Year:
2007

Citing 0
Cited 1

Path Partitions, Cycle Covers and Integer Decomposition

Graph Theory, Computational Intelligence and Thought

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 1963, Tibor Gallai [9] asked whether every strongly connected directed graph D is spanned by α directed circuits, where α is the stability of D. We give a proof of this conjecture.