Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (Q1426221)
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: Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. |
scientific article; zbMATH DE number 2056632
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. |
scientific article; zbMATH DE number 2056632 |
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
