Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs
Abstract
Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs
| Origin | Files produced by the author(s) |
|---|
Journal Articles
Journal of Combinatorial Theory, Series B
Year : 2003
Stéphane Bessy : Connect in order to contact the contributor
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00738215
Submitted on : Wednesday, October 3, 2012-5:26:39 PM
Last modification on : Tuesday, March 26, 2024-4:08:57 PM
Long-term archiving on : Friday, January 4, 2013-3:59:00 AM
Dates and versions
Identifiers
- HAL Id : lirmm-00738215 , version 1
- DOI : 10.1016/S0095-8956(02)00020-5
Cite
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, 2003, 87 (2), pp.289-299. ⟨10.1016/S0095-8956(02)00020-5⟩. ⟨lirmm-00738215⟩
Collections
91
View
234
Download