Pages that link to "Item:Q407602"
From MaRDI portal
The following pages link to Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602):
Displaying 6 items.
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
- Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
- \(\{0, 2 \}\)-degree free spanning forests in graphs (Q2339439) (← links)
- On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
- (Q3758841) (← links)