Pages that link to "Item:Q1753010"
From MaRDI portal
The following pages link to Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010):
Displaying 14 items.
- I,F-partitions of sparse graphs (Q298327) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- Sparse partition universal graphs for graphs of bounded degree (Q633606) (← 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)
- Fair splittings by independent sets in sparse graphs (Q2182042) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
- Vertex Partitions into an Independent Set and a Forest with Each Component Small (Q5009333) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- (Q5284057) (← links)
- An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
