Smallest number of vertices in a 2-arc-strong digraph without good pairs (Q2087467)
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: Smallest number of vertices in a 2-arc-strong digraph without good pairs |
scientific article; zbMATH DE number 7604607
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smallest number of vertices in a 2-arc-strong digraph without good pairs |
scientific article; zbMATH DE number 7604607 |
Statements
Smallest number of vertices in a 2-arc-strong digraph without good pairs (English)
0 references
21 October 2022
0 references
arc-disjoint branchings
0 references
out-branching
0 references
in-branching
0 references
arc-connectivity
0 references
