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
Algorithmes, Graphes et Combinatoire
CV
Stéphan Thomassé
Algorithmes, Graphes et Combinatoire

Abstract

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

Domains

Data Structures and Algorithms [cs.DS] Combinatorics [math.CO]
Fichier principal
Vignette du fichier
msss.pdf (271.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

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 : Friday, March 24, 2023-2:52:56 PM

Long-term archiving on: Friday, January 4, 2013-3:59:00 AM

Download

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INSMI ALGCO LIRMM MIPS UNIV-MONTPELLIER
89 View
219 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More