The following pages link to Packing cycles in graphs. II (Q1405116):
Displaying 17 items.
- König graphs for 3-paths and 3-cycles (Q266789) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Packing cycles in graphs (Q1403928) (← links)
- Packing closed trails into dense graphs. (Q1405105) (← links)
- Cycle packings in graphs and digraphs (Q1910593) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Labeled packing of cycles and circuits (Q2118238) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- A note on packing graphs without cycles of length up to five (Q2380220) (← 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)
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) (← links)
- On maximum cycle packings in polyhedral graphs (Q5177031) (← links)
- On König graphs with respect to P4 (Q5374003) (← links)
- A Min-Max Relation on Packing Feedback Vertex Sets (Q5388009) (← links)