Every strong digraph has a spanning strong subgraph with at most n + 2α - 2 arcs

Journal of Combinatorial Theory. Series B

Volumn 87, Issue 2, 2003, Pages 289-299

  Bessy, Stéphane ^a   Thomassé, Stéphan ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037374171     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(02)00020-5     Document Type: Article

References (11)

1. J. Bang-Jensen, G. Gutin, Digraphs: theory, algorithms and applications, Springer Monographs in Mathematics, Springer-Verlag, London, 2001.
2. J.A. Bondy, Basic graph theory: paths and circuits, in: R.L. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, Vol. 1, Elsevier, Amsterdam; MIT Press, Cambridge, MA, 1995, pp. 3-110.
3. J.A. Bondy, A short proof of the Chen-Manalastas theorem, Discrete Math. 146 (1995) 289-292.
4. C.C. Chen, P. Manalastas, Every finite strongly connected digraph of stability 2 has a Hamiltonian path, Discrete Math. 44 (1983) 243-250.
5. T. Gallai, Problem 15, in: M. Fiedler (Ed.), Theory of Graphs and its Applications, Czech. Acad. Sci. Prague, 1964, p. 161.
6. G. Gutin, M. Tewes, A. Yeo, Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs, Discrete Math. 222 (2000) 269-274.
7. S. Khuller, B. Raghavachari, N. Young, Approximating the minimum equivalent digraph, SIAM J. Comput. 24 (1995) 859-872.
8. C. Thomassen, Directed cycles with two chords and strong spanning directed subgraphs with few arcs, J. Combin. Theory Ser. B 66 (1996) 24-33.
9. S. Thomassé, Covering a strong digraph by α - 1 disjoint paths, a proof of Las Vergnas' conjecture, J. Combin. Theory Ser. B 83 (2001) 331-333.
10. S. Thomassé, Spanning a strong digraph by α cycles, the case α = 3 of Gallai's conjecture, Discrete Math., to appear.
11. A. Vetta, Approximating the minimum strongly connected subgraph via a matching lower bound, preprint.