The following pages link to Odd cycle packing (Q2875196):
Displaying 23 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Finding odd cycle transversals. (Q703225) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Packing odd circuits in Eulerian graphs (Q1403922) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q2904762) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Solving the stable set problem in terms of the odd cycle packing number (Q2978512) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- Packing Odd Circuits (Q3503215) (← links)
- Weak duality for packing edge-disjoint odd (<i>u, v</i>)-trails (Q4575730) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- (Q5115779) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- (Q5743379) (← links)
- (Q5743513) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)
- Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)
