The following pages link to Packing cycles in graphs (Q1403928):
Displaying 20 items.
- Scattered packings of cycles (Q306707) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Packing circuits in matroids (Q1013971) (← links)
- Packing cycles in graphs. II (Q1405116) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Box-total dual integrality, box-integrality, and equimodular matrices (Q2039243) (← links)
- Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- On ideal semicomplete digraphs (Q2296276) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Induced Packing of Odd Cycles in a Planar Graph (Q3652239) (← links)
- On maximum cycle packings in polyhedral graphs (Q5177031) (← links)
- When Is the Matching Polytope Box-Totally Dual Integral? (Q5219300) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
- A Min-Max Relation on Packing Feedback Vertex Sets (Q5388009) (← links)