Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Every strong digraph has a spanning strong subgraph with at most ..."

Stéphane Bessy, Stéphan Thomassé (2003)

> Home

Details and statistics

DOI: 10.1016/S0095-8956(02)00020-5

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/BessyT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/BessyT03
Stéphane Bessy, Stéphan Thomassé:
Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. J. Comb. Theory B 87(2): 289-299 (2003)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.