Pages that link to "Item:Q713977"

The following pages link to Disjoint cycles intersecting a set of vertices (Q713977):

Displaying 22 items.

• Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
• Graphs without two vertex-disjoint \(S\)-cycles (Q785795) (← links)
• The edge-Erdős-Pósa property (Q822640) (← links)
• Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
• \(K_4\)-expansions have the edge-Erdős-Pósa property (Q1689905) (← links)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
• The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
• An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
• Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
• Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
• Packing cycles through prescribed vertices (Q2275896) (← links)
• Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
• A tight Erdős-Pósa function for long cycles (Q2396891) (← links)
• Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
• Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
• Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
• Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
• Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (Q4978443) (← links)
• (Q5111250) (← links)
• Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← 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)