Disjoint cycles intersecting a set of vertices
From MaRDI portal
Recommendations
- Packing cycles through prescribed vertices
- Long cycles through prescribed vertices have the Erdős-Pósa property
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- ON DISJOINT CYCLES
- Packing cycles through prescribed vertices under modularity constraints
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- Approximability of Packing Disjoint Cycles
- Approximation algorithms and hardness results for cycle packing problems
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- Depth-First Search and Linear Graph Algorithms
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- On Independent Circuits Contained in a Graph
- Packing cycles in undirected graphs
- Packing cycles through prescribed vertices
- Packing directed circuits through prescribed vertices bounded fractionally
Cited in
(32)- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- Random graphs with few disjoint cycles
- Half-integral packing of odd cycles through prescribed vertices
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- The edge-Erdős-Pósa property
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
- Chordless Cycle Packing Is Fixed-Parameter Tractable
- Erdős-Pósa from ball packing
- Packing cycles through prescribed vertices
- Parameterised algorithms for deletion to classes of DAGs
- Graphs without two vertex-disjoint \(S\)-cycles
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
- Towards a polynomial kernel for directed feedback vertex set
- A tight Erdős-Pósa function for long cycles
- Recent techniques and results on the Erdős-Pósa property
- Towards a polynomial kernel for directed feedback vertex set
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Long cycles through prescribed vertices have the Erdős-Pósa property
- Packing cycles through prescribed vertices under modularity constraints
- Kernels for deletion to classes of acyclic digraphs
- \(K_4\)-expansions have the edge-Erdős-Pósa property
- \(K_4\)-subdivisions have the edge-Erdős-Pósa property
- Packing cycles faster than Erdős-Pósa
- Erdős-Pósa property of chordless cycles and its applications
- Erdős–Pósa property of obstructions to interval graphs
- Erdős-Pósa property for labeled minors: 2-connected minors
- Even A‐cycles have the edge‐Erdős–Pósa property
- Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices in highly connected graphs
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Edge disjoint cycles through specified vertices
- Erdös-Pósa Property of Obstructions to Interval Graphs
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
This page was built for publication: Disjoint cycles intersecting a set of vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713977)
