The following pages link to Packing directed cycles efficiently (Q867851):
Displaying 4 items.
- Packing edge-disjoint triangles in regular and almost regular tournaments (Q472970) (← links)
- Packing and covering directed triangles asymptotically (Q2065998) (← links)
- Packing Triangles in Regular Tournaments (Q2852611) (← links)
- Packing and Covering a Given Directed Graph in a Directed Graph (Q6146269) (← links)
