Pages that link to "Item:Q1007581"
From MaRDI portal
The following pages link to On the complexity of digraph packings (Q1007581):
Displaying 7 items.
- The complexity of generalized clique packing (Q1073049) (← links)
- Oriented star packings (Q2483479) (← links)
- The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612) (← links)
- (Q3139770) (← links)
- (Q4206754) (← links)
- Toward Wojda's conjecture on digraph packing (Q4690988) (← links)
- The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786) (← links)