Pages that link to "Item:Q3191152"
From MaRDI portal
The following pages link to NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS (Q3191152):
Displaying 4 items.
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- A short proof of Nash-Williams' theorem for the arboricity of a graph (Q1323488) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785) (← links)