Pages that link to "Item:Q3594953"
From MaRDI portal
The following pages link to Packingk-edge trees in graphs of restricted vertex degrees (Q3594953):
Displaying 14 items.
- Packing 3-vertex paths in claw-free graphs and related topics (Q617645) (← links)
- Chain packing in graphs (Q808291) (← links)
- Packing trees with constraints on the leaf degree (Q1014830) (← links)
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835) (← links)
- On the tree packing problem (Q1183337) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- Edge-packing planar graphs by cyclic graphs (Q1382263) (← links)
- Packing and decomposition of graphs with trees (Q1569062) (← links)
- The Edmonds-Gallai decomposition for the \(k\)-piece packing problem (Q1773199) (← links)
- \(H\)-packing of \(k\)-chromatic graphs (Q1937363) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
