"The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of ..."

Ran Gu et al. (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-92681-6_26

access: closed

type: Conference or Workshop Paper

metadata version: 2024-04-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/GuGLST21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/GuGLST21
Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu:
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings. COCOA 2021: 318-332

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.