Pages that link to "Item:Q2481185"

The following pages link to Decomposing a planar graph into a forest and a subgraph of restricted maximum degree (Q2481185):

Displaying 10 items.

• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
• Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
• Decomposing a graph into forests (Q765188) (← links)
• Planar graphs decomposable into a forest and a matching (Q998522) (← links)
• Covering planar graphs with forests, one having bounded maximum degree (Q1003834) (← links)
• Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
• Decomposing a planar graph into an independent set and a 3-degenerate graph (Q1850567) (← links)
• Decomposition of sparse graphs into forests and a graph with bounded degree (Q2862551) (← links)
• (Q3758841) (← links)
• Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)