Half-integral packing of odd cycles through prescribed vertices
From MaRDI portal
Publication:2259381
DOI10.1007/s00493-013-2865-6zbMath1324.05148OpenAlexW2018366661MaRDI QIDQ2259381
Ken-ichi Kawarabayashi, Naonori Kakimura
Publication date: 3 March 2015
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-013-2865-6
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
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 ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Packing Cycles Faster Than Erdos--Posa
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Packing cycles through prescribed vertices under modularity constraints
- Packing cycles with modularity constraints
- Disjoint cycles intersecting a set of vertices
- Mangoes and blueberries
- Disjoint paths in graphs
- 2-linked graphs
- Highly connected sets and the excluded grid theorem
- Quickly excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Packing cycles through prescribed vertices
- On the odd-minor variant of Hadwiger's conjecture
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- On the presence of disjoint subgraphs of a specified type
- Packing cycles in undirected graphs
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- Approximation algorithms and hardness results for cycle packing problems
- On Independent Circuits Contained in a Graph
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
This page was built for publication: Half-integral packing of odd cycles through prescribed vertices
