Pages that link to "Item:Q1748265"

The following pages link to Decomposing a graph into forests and a matching (Q1748265):

Displaying 13 items.

• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
• Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
• Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
• Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
• Decomposing a graph into forests (Q765188) (← links)
• Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
• Extensions of matroid covering and packing (Q1633609) (← links)
• Decomposing graphs into a spanning tree, an even graph, and a star forest (Q1732026) (← links)
• The pseudoforest analogue for the strong nine dragon tree conjecture is true (Q2200931) (← links)
• Decomposition of sparse graphs into forests and a graph with bounded degree (Q2862551) (← links)
• (Q3758841) (← links)
• Digraph analogues for the Nine Dragon Tree Conjecture (Q6046686) (← links)
• An extension of Nash-Williams and Tutte's theorem (Q6657600) (← links)