Pages that link to "Item:Q2423361"

The following pages link to On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361):

Displaying 9 items.

• I,F-partitions of sparse graphs (Q298327) (← links)
• Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
• Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
• Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
• On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
• An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
• Partitioning planar graph of girth 5 into two forests with maximum degree 4. (Q6584423) (← links)