Skip to Main content Skip to Navigation
Journal articles

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

Stéphane Bessy 1 Stéphan Thomassé 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00738215
Contributor : Stéphane Bessy <>
Submitted on : Wednesday, October 3, 2012 - 5:26:39 PM
Last modification on : Wednesday, June 30, 2021 - 12:19:24 PM
Long-term archiving on: : Friday, January 4, 2013 - 3:59:00 AM

File

msss.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Stéphane Bessy, Stéphan Thomassé. Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs. Journal of Combinatorial Theory, Series B, Elsevier, 2003, 87 (2), pp.289-299. ⟨10.1016/S0095-8956(02)00020-5⟩. ⟨lirmm-00738215⟩

Share

Metrics

Record views

227

Files downloads

496