Pages that link to "Item:Q989491"
From MaRDI portal
The following pages link to On packing shortest cycles in graphs (Q989491):
Displaying 9 items.
- Shortest \((A+B)\)-path packing via hafnian (Q724248) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Packing cycles in graphs. II (Q1405116) (← links)
- Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047) (← links)
- Maximum cycle packing using SPR-trees (Q5009941) (← links)
- On maximum cycle packings in polyhedral graphs (Q5177031) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)