Pages that link to "Item:Q5955201"

The following pages link to The Erdős-Pósa property for odd cycles in highly connected graphs (Q5955201):

Displaying 32 items.

• Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
• The Erdős-Pósa property for clique minors in highly connected graphs (Q412171) (← links)
• Packing cycles with modularity constraints (Q653988) (← links)
• The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342) (← links)
• Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
• Highly parity linked graphs (Q987554) (← links)
• Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
• Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
• An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
• Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← 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)
• The Erdős-Pósa property for long circuits (Q2460617) (← links)
• Non-zero disjoint cycles in highly connected group labelled graphs (Q2490257) (← links)
• Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
• Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles (Q2862553) (← links)
• Edge-disjoint odd cycles in 4-edge-connected graphs (Q2904762) (← links)
• The Erdős-Pósa Property for Long Circuits (Q2930041) (← 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)
• Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
• Non-zero disjoint cycles in highly connected group labeled graphs (Q3439347) (← links)
• Two disjoint negative cycles in a signed graph (Q3439485) (← links)
• Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (Q4978443) (← links)
• Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
• Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
• Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
• The Cycling Property for the Clutter of Odd st-Walks (Q5418980) (← links)
• The Erdős-Pósa property for odd cycles in graphs of large connectivity (Q5955205) (← links)
• Even A‐cycles have the edge‐Erdős–Pósa property (Q6081562) (← links)
• Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
• A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)