Packing cycles through prescribed vertices under modularity constraints
DOI10.1016/J.AAM.2012.03.002zbMATH Open1245.05102OpenAlexW1989287241MaRDI QIDQ444427FDOQ444427
Authors: Naonori Kakimura, Ken-ichi Kawarabayashi 
Publication date: 14 August 2012
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2012.03.002
Recommendations
- Packing cycles through prescribed vertices
- Half-integral packing of odd 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
- Disjoint cycles intersecting a set of vertices
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Graph minors. XIII: The disjoint paths problem
- Packing cycles with modularity constraints
- Disjoint paths in graphs
- 2-linked graphs
- Highly connected sets and the excluded grid theorem
- Quickly 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
- Title not available (Why is that?)
- Packing cycles through prescribed vertices
- Packing cycles in undirected graphs
- On the presence of disjoint subgraphs of a specified type
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Disjoint cycles intersecting a set of vertices
Cited In (14)
- On the presence of disjoint subgraphs of a specified type
- Packing cycles with modularity constraints
- Packing directed cycles through a specified vertex set
- Packing \(A\)-paths of length zero modulo four
- Scattered packings of cycles
- Disjoint cycles intersecting a set of vertices
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
- Even A‐cycles 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
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- Half-integral packing of odd cycles through prescribed vertices
- Packing cycles through prescribed vertices
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
This page was built for publication: Packing cycles through prescribed vertices under modularity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444427)
