The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings (Q2149881)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings |
scientific article |
Statements
The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings (English)
0 references
29 June 2022
0 references
arc-disjoint branchings
0 references
out-branching
0 references
in-branching
0 references
arc-connectivity
0 references
