Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (Q1426221): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0743-7315(03)00107-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973587859 / rank | |||
Normal rank | |||
Latest revision as of 11:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. |
scientific article |
Statements
Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (English)
0 references
14 March 2004
0 references
Edge-disjoint spanning trees
0 references
Node-disjoint paths
0 references
Alternating group graphs
0 references
Arrangement graphs
0 references
Fault tolerance
0 references
