Pages that link to "Item:Q868342"

The following pages link to The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342):

Displaying 14 items.

• Packing cycles with modularity constraints (Q653988) (← links)
• An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
• Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
• Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
• Non-zero disjoint cycles in highly connected group labelled graphs (Q2490257) (← links)
• Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles (Q2862553) (← links)
• Strengthening Erdös-Pósa property for minor-closed graph classes (Q3083410) (← links)
• Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
• (Q3378354) (← links)
• Non-zero disjoint cycles in highly connected group labeled graphs (Q3439347) (← links)
• Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (Q4978443) (← links)
• Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
• The Erdős-Pósa property for odd cycles in highly connected graphs (Q5955201) (← links)
• Even A‐cycles have the edge‐Erdős–Pósa property (Q6081562) (← links)