Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs (Q1861573): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4871749 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity and edge-disjoint spanning trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank | |||
Normal rank |
Latest revision as of 13:22, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs |
scientific article |
Statements
Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs (English)
0 references
9 March 2003
0 references