Decomposing highly edge-connected graphs into paths of any given length (Q345101)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing highly edge-connected graphs into paths of any given length |
scientific article |
Statements
Decomposing highly edge-connected graphs into paths of any given length (English)
0 references
25 November 2016
0 references
path
0 references
decomposition
0 references
connectivity
0 references
