Packing cycles through prescribed vertices
From MaRDI portal
Recommendations
- Packing cycles through prescribed vertices under modularity constraints
- Packing cycles in graphs
- Packing directed cycles through a specified vertex set
- Packing cycles in complete graphs
- Cycle packings in graphs and digraphs
- scientific article; zbMATH DE number 637534
- Packing cycles exactly in polynomial time
- Half-integral packing of odd cycles through prescribed vertices
- Packing cycles in undirected graphs
- Packing directed cycles efficiently
Cites work
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- Approximation algorithms and hardness results for cycle packing problems
- Disjoint cycles intersecting a set of vertices
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- On Independent Circuits Contained in a Graph
- On the odd-minor variant of Hadwiger's conjecture
- On the presence of disjoint subgraphs of a specified type
- Packing directed circuits
Cited in
(36)- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
- Long cycles through prescribed vertices have the Erdős-Pósa property
- Parameterised algorithms for deletion to classes of DAGs
- Packing cycles faster than Erdős-Pósa
- Towards a polynomial kernel for directed feedback vertex set
- Towards a polynomial kernel for directed feedback vertex set
- On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- \(K_4\)-subdivisions have the edge-Erdős-Pósa property
- Packing directed cycles through a specified vertex set
- Erdős-Pósa property of chordless cycles and its applications
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
- Chordless Cycle Packing Is Fixed-Parameter Tractable
- Erdös-Pósa Property of Obstructions to Interval Graphs
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Scattered packings of cycles
- Packing cycles through prescribed vertices under modularity constraints
- Disjoint cycles intersecting a set of vertices
- Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Even A‐cycles have the edge‐Erdős–Pósa property
- An improved kernel for planar vertex-disjoint triangle packing
- Packing directed cycles efficiently
- Kernels for deletion to classes of acyclic digraphs
- Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices in highly connected graphs
- \(K_4\)-expansions have the edge-Erdős-Pósa property
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Erdős-Pósa property for labeled minors: 2-connected minors
- Erdős-Pósa from ball packing
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- Half-integral packing of odd cycles through prescribed vertices
- Erdős–Pósa property of obstructions to interval graphs
- A tight Erdős-Pósa function for long cycles
- Recent techniques and results on the Erdős-Pósa property
- Graphs without two vertex-disjoint S-cycles
This page was built for publication: Packing cycles through prescribed vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275896)
