Pages that link to "Item:Q722313"

The following pages link to Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313):

Displaying 7 items.

• Extensions of matroid covering and packing (Q1633609) (← links)
• An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785) (← links)
• Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
• The pseudoforest analogue for the strong nine dragon tree conjecture is true (Q2200931) (← links)
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering (Q4568066) (← links)
• Digraph analogues for the Nine Dragon Tree Conjecture (Q6046686) (← links)
• Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)