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

Journal article

Open access

Peer reviewed

Stéphane Bessy and Stéphan Thomassé

Journal of Combinatorial Theory, Series B, Vol.87(2), pp.289-299

2003

Abstract

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

url

Find in HALView

url

https://doi.org/10.1016/S0095-8956(02)00020-5View

Published (Version of record) Open

1 Record Views

Title: Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs
Creators - without role: Stéphane Bessy - Université Claude Bernard Lyon 1
Stéphan Thomassé - Université Claude Bernard Lyon 1
Publication Details: Journal of Combinatorial Theory, Series B, Vol.87(2), pp.289-299
Identifiers: 9947503309311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-00738215