Packing spanning trees in highly essentially connected graphs (Q1618210)
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: Packing spanning trees in highly essentially connected graphs |
scientific article; zbMATH DE number 6976889
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing spanning trees in highly essentially connected graphs |
scientific article; zbMATH DE number 6976889 |
Statements
Packing spanning trees in highly essentially connected graphs (English)
0 references
13 November 2018
0 references
edge-disjoint spanning trees
0 references
essential edge connectivity
0 references
nowhere-zero flows
0 references
circular flow number
0 references
spanning connectivity
0 references
supereulerian width
0 references
0 references
