Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem (Q1584336): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Edge‐disjoint spanning trees: A connectedness theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Basis pair graphs of transversal matroids are connected / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classification of interpolation theorems for spanning trees and other families of spanning subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3135082 / rank | |||
Normal rank | |||
Revision as of 17:05, 30 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem |
scientific article |
Statements
Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem (English)
0 references
2 November 2000
0 references
edge-disjoint spanning trees
0 references
weighted graph
0 references
interpolating theorem
0 references
graphical invariants
0 references
