\(k\)-connectivity and decomposition of graphs into forests (Q1343147): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3852212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the thickness and arboricity of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds of the number of disjoint spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707420 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4111952 / rank | |||
Normal rank | |||
Latest revision as of 11:38, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(k\)-connectivity and decomposition of graphs into forests |
scientific article |
Statements
\(k\)-connectivity and decomposition of graphs into forests (English)
0 references
1 February 1995
0 references
The authors show that for every \(k\)-(edge) connected graph there exists a sequence of spanning trees \((T_ 1,\dots, T_ k)\), such that \(T_ 1\cup T_ 2\cup\cdots \cup T_ j\) is \(j\)-(edge) connected for every \(1\leq j\leq k\).
0 references
\(k\)-connectivity
0 references
decomposition
0 references
forests
0 references
spanning trees
0 references
0 references
