The following pages link to The \(K_r\)-packing problem (Q5937570):
Displaying 16 items.
- Order consolidation for hierarchical product lines (Q2015800) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- On the complexity of the {<i>k</i>}-packing function problem (Q2968508) (← links)
- Resolvable packings of<i>K</i><i>v</i>with<i>K</i><sub>2</sub> × <i>K</i><i>c</i>'s (Q3619609) (← links)
- (Q3763183) (← links)
- (Q3818327) (← links)
- (Q4691867) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5900079) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5902134) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- A polynomial time algorithm for the triangle packing problem on interval graphs (Q6140241) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- The board packing problem (Q6167668) (← links)
- Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
