Packing cycles through prescribed vertices
From MaRDI portal
Publication:2275896
DOI10.1016/J.JCTB.2011.03.004zbMATH Open1223.05231OpenAlexW2104713819MaRDI QIDQ2275896FDOQ2275896
Authors: Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx 
Publication date: 10 August 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.03.004
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph minors. XIII: The disjoint paths problem
- Graph minors. V. Excluding a planar graph
- On the odd-minor variant of Hadwiger's conjecture
- Approximation algorithms and hardness results for cycle packing problems
- On Independent Circuits Contained in a Graph
- Packing directed circuits
- On the presence of disjoint subgraphs of a specified type
- Disjoint cycles intersecting a set of vertices
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
Cited In (36)
- Parameterised algorithms for deletion to classes of DAGs
- Packing cycles faster than Erdős-Pósa
- On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
- Towards a polynomial kernel for directed feedback vertex set
- Towards a polynomial kernel for directed feedback vertex set
- 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
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
- Erdős-Pósa property of chordless cycles and its applications
- 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
- Kernels for deletion to classes of acyclic digraphs
- Packing directed cycles efficiently
- Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices in highly connected graphs
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- \(K_4\)-expansions have the edge-Erdős-Pósa property
- 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
- Erdős–Pósa property of obstructions to interval graphs
- Half-integral packing of odd cycles through prescribed vertices
- A tight Erdős-Pósa function for long cycles
- Recent techniques and results on the Erdős-Pósa property
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
- Graphs without two vertex-disjoint \(S\)-cycles
- Long cycles through prescribed vertices have the Erdős-Pósa property
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)
