NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS (Q3191152): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1705.01648 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition of Finite Graphs Into Forests / 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 | |||
| Property / cites work | |||
| Property / cites work: A short proof of Nash-Williams' theorem for the arboricity of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank | |||
Normal rank | |||
Latest revision as of 01:31, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS |
scientific article |
Statements
NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS (English)
0 references
24 September 2014
0 references
covering of graphs
0 references
