{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:32Z","timestamp":1759063712045},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0095-8956(02)00020-5","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T18:57:26Z","timestamp":1045508246000},"page":"289-299","source":"Crossref","is-referenced-by-count":4,"title":["Every strong digraph has a spanning strong subgraph with at most n+2\u03b1\u22122 arcs"],"prefix":"10.1016","volume":"87","author":[{"given":"St\u00e9phane","family":"Bessy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(02)00020-5_BIB1","unstructured":"J. Bang-Jensen, G. Gutin, Digraphs: theory, algorithms and applications, Springer Monographs in Mathematics, Springer-Verlag, London, 2001."},{"key":"10.1016\/S0095-8956(02)00020-5_BIB2","unstructured":"J.A. Bondy, Basic graph theory: paths and circuits, in: R.L. Graham, M. Gr\u00f6tschel, L. Lov\u00e1sz (Eds.), Handbook of Combinatorics, Vol. 1, Elsevier, Amsterdam; MIT Press, Cambridge, MA, 1995, pp. 3\u2013110."},{"key":"10.1016\/S0095-8956(02)00020-5_BIB3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0012-365X(94)00173-1","article-title":"A short proof of the Chen\u2013Manalastas theorem","volume":"146","author":"Bondy","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(02)00020-5_BIB4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(83)90188-7","article-title":"Every finite strongly connected digraph of stability 2 has a Hamiltonian path","volume":"44","author":"Chen","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(02)00020-5_BIB5","unstructured":"T. Gallai, Problem 15, in: M. Fiedler (Ed.), Theory of Graphs and its Applications, Czech. Acad. Sci. Prague, 1964, p. 161."},{"key":"10.1016\/S0095-8956(02)00020-5_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0012-365X(00)00055-8","article-title":"Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs","volume":"222","author":"Gutin","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(02)00020-5_BIB7","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1137\/S0097539793256685","article-title":"Approximating the minimum equivalent digraph","volume":"24","author":"Khuller","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0095-8956(02)00020-5_BIB8","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1006\/jctb.1996.0003","article-title":"Directed cycles with two chords and strong spanning directed subgraphs with few arcs","volume":"66","author":"Thomassen","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(02)00020-5_BIB9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1006\/jctb.2001.2055","article-title":"Covering a strong digraph by \u03b1\u22121 disjoint paths, a proof of Las Vergnas\u2019 conjecture","volume":"83","author":"Thomass\u00e9","year":"2001","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(02)00020-5_BIB10","unstructured":"S. Thomass\u00e9, Spanning a strong digraph by \u03b1 cycles, the case \u03b1 = 3 of Gallai's conjecture, Discrete Math., to appear."},{"key":"10.1016\/S0095-8956(02)00020-5_BIB11","unstructured":"A. Vetta, Approximating the minimum strongly connected subgraph via a matching lower bound, preprint."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T10:55:32Z","timestamp":1553684132000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895602000205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0095895602000205"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(02)00020-5","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}