Pages that link to "Item:Q490985"
From MaRDI portal
The following pages link to Decomposing a graph into pseudoforests with one having bounded degree (Q490985):
Displaying 10 items.
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- Decomposing a graph into forests and a matching (Q1748265) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
- The pseudoforest analogue for the strong nine dragon tree conjecture is true (Q2200931) (← links)
- (Q3758841) (← links)
- Digraph analogues for the Nine Dragon Tree Conjecture (Q6046686) (← links)
- The spectral radius, maximum average degree and cycles of consecutive lengths of graphs (Q6121917) (← links)