A short proof of the tree-packing theorem (Q418872): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084251294 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0911.2809 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5315023 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lehmans switching game and a theorem of Tutte and Nash-Williams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamilton cycles in 5-connected line graphs / 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: Q3330973 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reflections on graph theory / 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 07:25, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A short proof of the tree-packing theorem |
scientific article |
Statements
A short proof of the tree-packing theorem (English)
0 references
30 May 2012
0 references
spanning tree
0 references
packing
0 references