Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Combinatorial Theory, Series B Year : 2003

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

Stéphane Bessy
Stéphan Thomassé

Abstract

Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs
Fichier principal
Vignette du fichier
msss.pdf (271.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00738215 , version 1 (03-10-2012)

Identifiers

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⟩
90 View
228 Download

Altmetric

Share

Gmail Facebook X LinkedIn More